Monadic second-order definable text languages

Theory of Computing Systems

Volumn 30, Issue 4, 1997, Pages 335-354

  Hoogeboom, H J ^a   Ten Pas, P ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

ALGEBRAIC FRAMEWORK; GENERIC TREE; LINEAR ORDER; MONADIC SECOND-ORDER LOGIC; SECOND ORDERS;

CHARACTER RECOGNITION;

EID: 0031533854     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/BF02679464     Document Type: Article

References (24)

1. H.L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Technical Report UU-CS-1996-02, Department of Computer Science, Utrecht University, Utrecht, 1996.
2. J.R. Büchi, Weak second-order arithmetic and finite automata, Z. Math. Logik Grundlag. Math. 6 (1960), 66-92.
3. P.M. Cohn, Universal Algebra, Harper & Row, New York, 1965.
4. B. Courcelle, An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theoret. Comput. Sci. 55 (1987), 141-181.
5. B. Courcelle, The monadic second-order logic of graphs, I: recognizable sets of finite graphs, Inform. Comput. 85 (1990), 12-75.
6. B. Courcelle, The monadic second-order logic of graphs, V: on closing the gap between definability and recognizability, Theoret. Comput. Sci. 80 (1991), 153-202.
7. B. Courcelle, Monadic second-order definable graph transductions: a survey, Theoret. Comput. Sci. 126 (1994), 53-75.
8. B. Courcelle, The monadic second-order logic of graphs, X: linear orderings, Theoret. Comput. Sci. 160 (1996), 87-143.
9. J. Doner, Tree acceptors and some of their applications, J. Comput. System Sci. 4 (1970), 406-451.
10. A. Ehrenfeucht and G. Rozenberg, Theory of 2-structures, I and II, Theoret. Comput. Sci. 70 (1990), 277-342.
11. A. Ehrenfeucht and G. Rozenberg, T-functions, T-structures, and texts, Theoret. Comput. Sci. 116 (1993), 227-290.
12. A. Ehrenfeucht, P. ten Pas, and G. Rozenberg, Combinatorial properties of texts, RAIRO Inform. Théor. 27 (1993), 433-464.
13. A. Ehrenfeucht, P. ten Pas, and G. Rozenberg, Context-free text grammars, Acta Inform. 31 (1994), 161-206.
14. J. Engelfriet, A characterization of context-free NCE graph languages by monadic second-order logic on trees. In: Graph Grammars and Their Application to Computer Science (H. Ehrig, H.-J. Kreowski, and G. Rozenberg, eds.). Lecture Notes in Computer Science, Vol. 532, Springer-Verlag, Berlin, 1991, pp. 311-327.
15. J. Engelfriet, A regular characterization of graph languages definable in monadic second-order logic, Theoret. Comput. Sci. 88 (1991), 139-150.
16. J. Engelfriet, T. Harju, A. Proskurowski, and G. Rozenberg, Characterization and complexity of uniformly nonprimitive labeled 2-structures, Theoret. Comput. Sci. 154 (1996), 247-282.
17. F. Gecseg and M. Steinby, Tree Automata, Akademiai Kiado, Budapest, 1984.
18. H.J. Hoogeboom and P. ten Pas, MSO definable text languages. In: Mathematical Foundations of Computer Science (I. Prívara, B. Rovan, and P. Ružička, eds.). Lecture Notes in Computer Science, Vol. 841, Springer-Verlag, Berlin, 1994, pp. 413-422.
19. H.J. Hoogeboom and P. ten Pas, Text languages in an algebraic framework, Fund. Inform. 25 (1995), 353-380.
20. J. Mezei and J.B. Wright, Algebraic automata and context-free sets, Inform. and Control 11 (1967), 3-29.
21. R.H. Möhring and F.J. Radermacher, Substitution decomposition for discrete structures and connections with combinatorial optimization, Ann. Discrete Math. 19 (1984), 257-356.
22. P. ten Pas, Texts and Trees, Ph.D. Thesis, Leiden University, May 1995.
23. A. Potthoff and W. Thomas, Regular tree languages without unary symbols are star-free. In: Fundamentals of Computation Theory (Z. Ésik, ed.). Lecture Notes in Computer Science, Vol. 710, Springer-Verlag, Berlin, 1993, pp. 396-405.
24. J.W. Thatcher and J.B. Wright, Generalized finite automata theory with an application to a decision problem of second-order logic, Math. System Theory 2 (1968), 57-82.