Algebraic recognizability of languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3153, Issue , 2004, Pages 149-175

  Weil, Pascal ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

COMPLEX MODEL; FINITE WORDS; RECOGNIZABLE LANGUAGES;

COMPUTATIONAL LINGUISTICS;

EID: 21144447737     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28629-5_8     Document Type: Article

References (89)

1. J. Almeida. Finite semigroups and universal algebra. Series in Algebra 3, World Scientific, Singapore (1994).
2. R. Alur, D. Dill. A Theory of Timed Automata, Theoret. Computer Science 126 (1994) 183-235.
3. R. Alur, M. Yannakakis. Model Checking of Message Sequence Charts. In: Proc. CONCUR 99, Lect. Notes in Computer Science 1664, 114-129, Springer, 1999.
4. E. Asarin, O. Maler, P. Caspi Timed Regular Expressions, Journal of the ACM 49 (2002) 172-206.
5. M. Beaudry. Finite idempotent groupoids and regular languages, RAIRO Informatique théorique 32 (1998) 127-140.
6. M. Beaudry. Languages recognized by finite aperiodic groupoids, Theoret. Computer Science 209 (1998) 299-317.
7. M. Beaudry, F. Lemieux. D. Thérien. Finite loops recognize exactly the regular open languages. In Proc. ICALP 97, Lect. Notes in Computer Science (1997), pp. 110-120.
8. M. Beaudry, F. Lemieux. D. Therien. Star-free open languages and aperiodic loops. In Proc. STAGS 01, Lect. Notes in Computer Science 2010, 87-98, Springer, 2001.
9. N. Bedon. Logic over words on denumerable ordinals, J. Computer and System Science 63 (2001) 394-431.
10. N. Bedon. Automata, semigroups and recognizability of words on ordinals, Intern. J. Algebra and Computation 8 (1998) 1-21.
11. J. Berstel. Transductions and context-free languages, Teubner, Stuttgart (1979).
12. P. Bouyer, A. Petit, D. Thérien. An algebraic characterization of data and timed languages, Information and Computation 182 (2003) 137-162.
13. V. Bruyère, O. Carton. Automata on linear orderings. In: Proc. DLT 02 (M. Ito, M. Toyama, eds.), Lect. Notes in Computer Science 2450, 103-115, Springer 2002.
14. S. Cho, D.T. Huynh. Finite automaton aperiodicity is PSAPCE-complete. Theoret. Computer Science 88 (1991) 99-116.
15. n-tapes, J. Computer and System Sciences 17 (1978) 81-97.
16. B. Courcelle. The monadic second-order logic of graphs I: recognizable sets of finite graphs, Information and Computation 85 (1990) 12-75.
17. B. Courcelle. Basic notions of universal algebra for language theory and graph grammars, Theoret. Computer Science 163 (1996) 1-54.
18. B. Courcelle. The monadic second-order logic of graphs X: Linear orders, Theoret. Computer Science 160 (1996) 87-143.
19. B. Courcelle. The expression of graph properties and graph transformations in monadic second order logic. In: Handbook of Graph Grammars and Computing by Graph Transformations (G. Rozenberg, ed.), vol. 1, chapter 5. World Scientific, 1997, 313-400.
20. B. Courcelle. The monadic second-order logic of graphs XIV: Uniformly sparse graphs and edge set quantifications, Theoret. Computer Science 299 (2003) 1-36.
21. B. Courcelle, P. Weil. The recognizability of sets of graphs is a robust property, to appear.
22. O. Carton. Wreath product and infinite words, J. Pure and Applied Algebra 153 (2000) 129-150.
23. D. Corneil, H. Lerchs, L. Stewart. Complement reducible graphs, Discrete Applied Mathematics 3 (1981) 163-174.
24. S. Demri, D. D'Souza. An Automata-Theoretic Approach to Constraint LTL. In: Proc. FSTTCS 02, Lect. Notes in Computer Science 2256,121-132, Springer, 2002.
25. K. Denecke, S. L. Wismath. Universal Algebra and Applications in Theoretical Computer Science, Chapman and Hall (2002).
26. V. Diekert, P. Gastin. Pure future local temporal logics are expressively complete for Mazurkiewicz traces. In: Proceedings of LATIN'04, Lect. Notes in Computer Science 2976, 232-241, Springer, 2004.
27. V. Diekert, G. Rozenberg (eds.). The book of traces, World Scientific (1995).
28. C. Dima. Real-time automata and the Kleene algebra of sets of real numbers, J. Automata, Languages and Computation 6 (2001) 3-23.
29. J. Doner. Tree acceptors and some of their applications, J. Comput. System Sci. 4 (1970) 406-451.
30. W. Ebinger, A. Muscholl. On logical definability of omega-trace languages. Theoret. Computer Science 154 (1996) 67-84.
31. A. Ehrenfeucht, G. Rozenberg. Theory of 2-structures, Part 1: clans, basic subclasses and morphism. Part 2: representation through labeled tree families, Theoret. Computer Science 70 (1990) 277-303, 305-342.
32. A. Ehrenfeucht, G. Rozenberg. Angular 2-structures, Theoret. Computer Science 92 (1992) 227-248.
33. S. Eilenberg. Automata, languages and machines, vol. A (1974) and vol. B (1976), Academic Press, New York.
34. J. Engelfriet, T. Harju, A. Proskurowski, G. Rozenberg. Characterization and complexity of uniformly nonprimitive labeled 2-structures, Theoret. Computer Science 154 (1996) 247-282.
35. Z. Ésik, Z. Nérneth. Higher dimensional automata, to appear.
36. Z. Ésik, P. Weil. On logically defined recognizable tree languages. In: Proc. FST TCS 2003 (P. K. Pandya, J. Radhakrishnan eds.), Lect. Notes in Computer Science 2914 (2003), Springer, 195-207.
37. K. Etessami, M. Y. Vardi, Th. Wilke. First-order logic with two variables and unary temporal logic. Inform, and Computation 179 (2002) 279-295.
38. N. Francez, M. Kaminski. An algebraic characterization of deterministic regular languages over infinite alphabets, Theoret. Computer Science 306 (2003) 155-175.
39. F. Gécseg, M. Steinby. Tree automata, Akadémiai Kiadó, Budapest (1994).
40. D. Giammarresi, A. Restivo. Two-dimensional languages. In: Handbook of Formal Languages (G. Rozenberg and A. Salomaa, eds), volume III, Springer, New York, 1997.
41. J. Grabowski. On partial languages, Fundamenta Informatica 4 (1981) 427-498.
42. G. Guaiana, A. Restivo, S. Salemi. Star-Free Trace Languages, Theoret. Computer Science 97 (1992) 301-311.
43. J.G. Henriksen, M. Mukund, K. Narayan Kumar, P.S. Thiagarajan. Regular Collections of Message Sequence Charts. In: Proc. MFCS 00, Lect. Notes in Computer Science 1893, 405-414, Springer, 2000.
44. J.G. Henriksen, M. Mukund, K. Narayan Kumar, P.S. Thiagarajan. On Message Sequence Graphs and Finitely Generated Regular MSC Languages. In: Proc. ICALP 00, Lect. Notes in Computer Science 1853, 675-686, Springer, 2000.
45. T. Henzinger, J.-F. Raskin, P.-Y. Schobbens. The Regular Real-Time Languages. In: Proc. ICALP'98, Lect. Notes in Computer Science 1443, 580-591, Springer, 1998.
46. U. Heuter. First-order properties of trees, star-free expressions, and aperiodicity. In: Proc. STAGS 88, Lect. Notes in Computer Science 294, 136-148, Springer, 1988.
47. H.J. Hoogeboom, P. ten Pas. Text languages in an algebraic framework, Fundamenta Informatica 25 (1996) 353-380.
48. H.J. Hoogeboom, P. ten Pas. Monadic second order definable text languages, Theory Comput. Syst. 30 (1997) 335-354.
49. J. A. Kamp. Tense logic and the theory of linear order, Ph. D. Thesis, UCLA, 1968.
50. S. Kim, R. McNaughton, R. McCloskey. A polynomial time algorithm for the local testability problem of deterministic finite automata, IEEE Trans. Comput. 40 (1991) 1087-1093.
51. E. Kushilevitz, N. Nisan. Communication Complexity, Cambridge University Press (1997).
52. D. Kuske. Towards a language theory for infinite AT-free pomsets, Theoret. Computer Science 299 (2003) 347-386.
53. D. Kuske. Regular sets of infinite message sequence charts, Information and Computation 187 (2003) 90-109.
54. D. Lapoire. Recognizability equals Monadic Second-Order definability, for sets of graphs of bounded tree-width. In: Proc. STAGS 98. Lect. Notes in Computer Science 1373, 618-628, Springer, 1998.
55. K. Lodaya, P. Weil. Series-parallel languages and the bounded-width property, Theoret. Computer Science 237 (2000) 347-380.
56. K. Lodaya, P. Weil. Rationality in algebras with a series operation, Information and Computation 171 (2001) 269-293.
57. R. McConnell, J. Spinrad. Modular decomposition and transitive orientation, Discrete Mathematics 201 (1999) 189-241.
58. O. Maler, A. Pnueli. On Recognizable Timed Languages. In: Proc. FOSSACS 04, Lect. Notes in Computer Science 2987, 348-362, Springer, 2004.
59. B. Meenakshi and R. Ramanujam. Reasoning about layered message-passing systems. In: Proc. VMCAI 03, of Lect. Notes in Computer Science 2575, 268-282, Springer, 2003.
60. J. Mezei and J. B. Wright. Algebraic automata and context-free sets, Information and Control 11 (1967) 3-29.
61. R.H. Möhring, F.J. Radermacher. Substitution decomposition for discrete structures and connections with combinatorial optimization, Annals of Discrete Mathematics 19 (1984) 257-356.
62. M. Mukund, K. Narayan Kumar, M. Sohoni. Synthesizing distributed finite-state systems from MSCs. In: Proc. CONCUR 00, Lect. Notes in Computer Science 1877, 521-535, Springer, 2000.
63. A. Muscholl, D. Peled. Message sequence graphs and decision problems on Mazurkiewicz traces. In: Proc. MFCS 99 (M. Kutylowski, L. Pacholski, eds.), Lect. Notes in Computer Science 1672, 81-91, Springer, 1999.
64. D. Peled. Specification and Verification of Message Sequence Charts. In: Proc. FORTE 2000, IFIP Conference Proceedings 183, 139-154, Kluwer, 2000.
65. D. Perrin, J.-E. Pin. Semigroups and automata on infinite words. In: NATO Advanced Study Institute Semigroups, Formal Languages and Groups (J. Fountain, éd.), pp. 49-72, Kluwer, 1995.
66. D. Perrin, J.-E. Pin. Infinite words, Pure and Applied Mathematics Vol. 141, Elsevier (2004).
67. J.-E. Pin. Variétés de langages formels, Masson, Paris (1984);
68. English translation: Varieties of formal languages, Plenum, New-York (1986).
69. J.-E. Pin. Logic, Semigroups and Automata on Words. Annals of Mathematics and Artificial Intelligence 16 (1996) 343-384.
70. J.-E. Pin. Syntactic semigroups. Chap. 10 in: Handbook of formal languages, Vol. I (G. Rozenberg et A. Salomaa, eds.), Springer Verlag, 1997, 679-746.
71. J.-E. Pin, P. Weil. Polynomial closure and unambiguous product. Theory Comput. Systems 30 (1997) 383-422.
72. A. Potthoff. Modulo counting quantifiers over finite trees. In: Proc. CAAP '92, Lect. Notes in Computer Science 581, 265-278, Springer, 1992.
73. A. Potthoff. First order logic on finite trees. In: Proc. TAPSOFT '95, Lect. Notes in Computer Science 915, Springer, 1995.
74. J. Sakarovitch. Élements de théorie des automates, Vuibert, Paris (2003).
75. M. P. Schützenberger. Sur le produit de concaténation non ambigu. Semigroup Forum 13 (1976) 47-75.
76. M. Sipser. Introduction to the theory of computation, International Thompson Publishing (1996).
77. J. Stern. Characterization of some classes of regular events. Theoret. Computer Science 35 (1985) 17-42.
78. H. Straubing. Finite automata, formal logic, and circuit complexity, Birkhaüser (1994).
79. P. Tesson, D. Thérien. Complete classifications for the communication complexity of regular languages. In STAGS 2003, H. Alt, M. Habib (Eds.), Lect. Notes in Computer Science 2607, pp. 62-73, Springer (2003).
80. J. W. Thatcher, J. B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Systems Theory 2 (1968) 57-81.
81. 2. In Proc. 13th ACM SToC, 41-47, 1998.
82. D. Thérien, Th. Wilke. Temporal logic and semidirect products: An effective characterization of the until hierarchy. SIAM Journal on Computing 31 (2002) 777-798.
83. P.S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for Mazurkiewicz traces. In Proc. LICS 97, 183-194, 1997.
84. W. Thomas. Classifying regular events in symbolic logic. J. Comput. Syst. Sci. 25 (1982) 360-375.
85. W. Thomas. Automata theory on trees and partial orders. In: Proc. TAPSOFT 97 (M. Bidoit, M. Dauchet, eds), Lect. Notes in Computer Science 1214, 20-38, Springer, 1997.
86. W. Thomas. Automata on infinite objects. In: Handbook of Theoretical Computer Science (J. van Leeuwen ed.), vol. B. Elsevier, 1990, 133-192.
87. W. Thomas. Languages, automata, and logic. In: Handbook of Formal Languages (G. Rozenberg, A. Salomaa, eds), volume III, 389-455, Springer, New York, 1997.
88. J. Valdes, R.E. Tarjan and E.L. Lawler. The recognition of series-parallel digraphs, SIAM J. Comput. 11 (1981) 298-313.
89. P. Weil. On the logical definability of certain graph and poset languages, J. Automata, Languages and Computation 9 (2004) 147-165.