Abstract
We provide a characterization of the local sets (sets of trees generated by CFGs) in terms of definability in a restricted logical language, which we contrast with a similar characterization of the recognizable sets (sets of trees accepted by finite-state tree automata). In a strong sense, the distinction between these two captures abstractly the distinction between ordinary CFGs and those in which labels are finitely extended with additional features (as in GPSG). In terms of descriptive complexity, the contrast is quite profound—while the recognizable sets are characterized by a monadic second-order language, the local sets are characterized by a severely restricted modal language. In the domain of strings, there is an analogous contrast between the regular languages and the strict 2-locally testable languages, a weak subclass of the star-free sets.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Patrick Blackburn, Claire Gardent, and Wilfried Meyer-Viol. Talking about trees. In EACL 93, pages 21–29. EACL, 1993.
Patrick Blackburn and Wilfried Meyer-Viol. Modal logic and model-theoretic syntax. In Martin de Rijke, editor, Advances in Intensional Logic, pages 27–58. Kluwer, 1996.
J. R. Büchi. Weak second-order arithmetic and finite automata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 6:66–92, 1960.
N. Chomsky and M. P. Schüzenberger. The algebraic theory of context-free languages. In P. Braffort and D. Hirschberg, editors, Computer Programming and Formal Systems, Studies in Logic and the Foundations of Mathematics, pages 118–161. North-Holland, Amsterdam, 2nd (1967) edition, 1963.
John Doner. Tree acceptors and some of their applications. Journal of Computer and System Sciences, 4:406–451, 1970.
Calvin C. Elgot. Decision problems of finite automata design and related arithmetics. Transactions of the American Mathematical Society, 98:21–51, 1961.
Kit Fine. A new characterization of context-free languages. Manuscript, Sept. 1991.
Ferenc Gécseg and Magnus Steinby. Tree Automata. Akadémiai Kiadö, Budapest, 1984.
Saul Gorn. Explicit definitions and linguistic dominoes. In John F. Hart and Satoru Takasu, editors, Systems and Computer Science, Proceedings of the Conference held at Univ. of Western Ontario, 1965. Univ. of Toronto Press, 1967.
Marcus Kracht. Syntactic codes and grammar refinement. Journal of Logic, Language, and Information, 4:41–60, 1995.
Robert McNaughton and Seymour Papert. Counter-Free Automata. Number 65 in Research Monograph. MIT Press, Cambridge, MA, 1971.
J. Mezei and J. B. Wright. Algebraic automata and context-free sets. Information and Control, 11:3–29, 1967.
Michael O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1–35, July 1969.
J. W. Thatcher. Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. Journal of Computer and System Sciences, 1:317–322, 1967.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rogers, J. (1997). Strict LT2 : Regular :: Local : Recognizable. In: Retoré, C. (eds) Logical Aspects of Computational Linguistics. LACL 1996. Lecture Notes in Computer Science, vol 1328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052167
Download citation
DOI: https://doi.org/10.1007/BFb0052167
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63700-4
Online ISBN: 978-3-540-69631-5
eBook Packages: Springer Book Archive