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.
Cite
CITATION STYLE
Hoogeboom, H. J., & ten Pas, P. (1994). MSO definable text languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 841 LNCS, pp. 413–422). Springer Verlag. https://doi.org/10.1007/3-540-58338-6_88
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
