On cloning context-freeness

The Mathematics of Syntactic Structure: Trees and their Logics

Volumn , Issue , 2011, Pages 195-229

  Mönnich, Uwe ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85145123042     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1515/9783110806786.195     Document Type: Chapter

References (27)

1. Arnold, A. and M. Dauchet (1976): Un thSoröme de duplication pour les förets algöbriques. JCOMS 13:223-244
2. Bénabou, J. (1968): Structures algdbriques dans les categories. Cahiers de Topologie et Geometrie Differentielles 10:1-126
3. Bloom, S. L. and Z. Esik (1993): Iteration Theories. Heidelberg: Springer
4. Büchi, J. R. (1960): Weak second-order arithmetic and finite automata. Z.Math. Logik Grundlag. Math. 6:66-92
5. Courcelle, B. (1992): The monadic seond-order logics of graphs VII: Graphs as relational structures. TCS 102:3-33
6. Culy, C. D. (1985): The complexity of the vocabulary of Bambara. Linguistics and Philosophy 8:345-351
7. Doner, J. E. (1970): Tree acceptors and some of their applications. J. Comput.System Sei. 4:406-451
8. Elgot, C. C. (1961): Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc. 98:21-51
9. Engelfriet, J. and E. M. Schmidt (1977): IO and OI, part I. J. Comput. System Sei. 15:328-353
10. Engelfriet, J. and E. M. Schmidt (1978): IO and OI, part Π. J. Comput. System Sei. 16:67-99
11. Fischer, M. J. (1968): Grammars with macro-like productions. In: Proceedings of the 9th Annual Symposium on Switching and Automata Theory, IEEE, pp. 131-142
12. Gallier, J. H. (1984): n-rational algebras i and ii. SIAM J. Comp. 13:750-794
13. Gécseg, F. and M. Steinby (1984): Tree Automata. Budapest: Akadémiai Kiadö
14. Gurevich, Y. (1985): Monadic second-order theories. In: J. Barwise and S. Feferman (eds.), Model-Theoretic Logics, Berlin/New York: Springer, Perspectives in Mathematical Logic, chap. XIII, pp. 479-506
15. Hoehnke, H.-J. (1972): Superposition partieller funktionen. In: H.-J.Hoehnke (ed.), Studien zur Algebra und ihre Anwendungen, Berlin:Akademie der Wissenschaften, pp. 7-26
16. Huybregts, M. A. C. (1984): The weak adequacy of context-free phrase structure grammar. In: G. J. de Haan, M. Trommelen, and W. Zonneveld (eds.), Van periferie naar kern, Dordrecht: Foris, pp. 81-99
17. Kolb, H.-P. (1999): Macros for Minimalism? Towards weak descriptions for strong structures. This volume, pp. 231-258
18. Läuchli, H. and C. Savioz (1987): Monadic second-order definable relations on the binary tree. J. Symb. Logic 52:219-226
19. Lautemann, C., T. Schwentick, and D. Thérien (1995): Logics for contextfree languages. In: L. Pacholski and J. Tiuryn (eds.), Computer Science Logic '94, Heidelberg: Springer, LNCS 933, pp. 205-216
20. Maibaum, T. S. E. (1974): A generalized approach to formal languages. J.Comput. System Sei. 8:409-439
21. McKenzie, R. N., G. F. McNulty, and W. F. Taylor (1987): Algebras, Lattices, Varieties, vol. 1. Monterey, CA: Wadsworth and Brookes Cole
22. Rabin, M. O. (1969): Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141:1-35
23. Rabin, M. O. (1972): Automata on infinite objects and church’s problem.American Mathematical Society
24. Rogers, J. (1994): Studies in the Logic of Trees with Applications to Grammar Formalisms. Ph.D. thesis, University of Delaware
25. Shieber, S. M. (1985): Evidence against the context-freeness of natural language.Linguistics and Philosophy 8(3):333-344
26. Siefkes, D. (1975): The recursive sets in certain monadic second-order fragments of arithmetics. Arch. Math. Logik 17:71-80
27. Thatcher, J. W. and J. B. Wright (1968): Generalized finite automata theory with an application to a decision problem of second-order logic. Math.Systems Theory 2(1):57-81