Abstract
A text is a word together with an (additional) linear ordering. Each text has a generic tree representation, called its shape. We consider texts in a logical and an algebraic framework, and we prove that the classes of monadic second order definable and of recognizable text languages coincide. In particular we demonstrate that the construction of the shape of a text can be formalized in terms of our monadic second-order logic. We briefly consider right-linear grammars for texts.
Research supported by the EBRA Working Group ASMICS 2.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J.R. Büchi, Weak second-order arithmetic and finite automata, Zeitschrift für Mathematik, Logic und Grundlagen der Mathematik 6 (1960) 66–92.
P.M. Cohn, Universal Algebra, Harper & Row, New York, 1965.
B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation 85 (1990) 12–75.
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.
B. Courcelle, Monadic second-order definable graph transductions, Lecture Notes in Computer Science 581 (1992) 124–144.
J. Doner, Tree acceptors and some of their applications, J. of Comp. and System Sci. 4 (1970) 406–451.
A. Ehrenfeucht and G. Rozenberg, Theory of 2-structures, Parts I and II, Theoret. Comput. Sci. 70 (1990) 277–342.
A. Ehrenfeucht and G. Rozenberg, T-functions, T-structures, and texts, Theoret. Comput. Sci. 116 (1993) 227–290.
A. Ehrenfeucht, P. ten Pas, and G. Rozenberg, Combinatorial properties of texts, RAIRO, Theor. Inf. 27 (1993) 433–464.
A. Ehrenfeucht, P. ten Pas, and G. Rozenberg, Context-free text grammars, Acta Informatica 31 (1994) 161–206.
J. Engelfriet, A characterization of context-free NCE graph languages by monadic second-order logic on trees, Lecture Notes in Computer Science 532 (1991) 311–327.
J. Engelfriet, A regular characterization of graph languages definable in monadic second-order, Theoret. Comput. Sci. 88 (1991) 139–150.
J. Engelfriet, T. Harju, A. Proskurowski, and G. Rozenberg, Survey on graphs as 2-structures and parallel complexity of decomposition, Technical Report 93-06 (1993), Dept. of Comp. Sci, Leiden University.
F. Gecseg and M. Steinby, Tree Automata, Akademiai Kiado, Budapest, 1984.
H.J. Hoogeboom and P. ten Pas, Text languages in an algebraic framework, Fundamenta Informaticae, to appear.
J. Mezei and J.B. Wright, Algebraic automata and context-free sets, Information and Control, 11 (1967) 3–29.
A. Potthoff and W. Thomas, Regular tree languages without unary symbols are star-free, Lecture Notes in Computer Science 710 (1993) 396–405.
J.W. Thatcher, J.B. Wright, Generalized finite automata theory with an application to a decision problem of second-order logic, Math. Syst. Th. 2 (1968) 57–82.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoogeboom, H.J., ten Pas, P. (1994). MSO definable text languages. In: Prívara, I., Rovan, B., Ruzička, P. (eds) Mathematical Foundations of Computer Science 1994. MFCS 1994. Lecture Notes in Computer Science, vol 841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58338-6_88
Download citation
DOI: https://doi.org/10.1007/3-540-58338-6_88
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58338-7
Online ISBN: 978-3-540-48663-3
eBook Packages: Springer Book Archive