The OI-Hierarchy Is Closed under Control
暂无分享,去创建一个
[1] Rainer Parchmann,et al. Linear Indexed Languages , 1984, Theor. Comput. Sci..
[2] Grzegorz Rozenberg,et al. TOL Schemes and Control Sets , 1975, Inf. Control..
[3] Joost Engelfriet,et al. Surface Tree Languages and Parallel Derivation Trees , 1976, Theor. Comput. Sci..
[4] Nabil A. Khabbaz. Control Sets on Linear Grammars , 1974, Inf. Control..
[5] Sheila A. Greibach,et al. Control Sets of Context-Free Grammar Forms , 1977, J. Comput. Syst. Sci..
[6] Mitchell Wand,et al. An algebraic formulation of the Chomsky hierarchy , 1974, Category Theory Applied to Computation and Control.
[7] Joost Engelfriet,et al. Iterated pushdown automata and complexity classes , 1983, STOC.
[8] Michael J. Fischer,et al. Grammars with Macro-Like Productions , 1968, SWAT.
[9] Joost Engelfriet,et al. Tree transducers, L systems and two-way machines (Extended Abstract) , 1978, J. Comput. Syst. Sci..
[10] Werner Damm,et al. An Automata-Theoretical Characterization of the OI-Hierarchy , 1986, Inf. Control..
[11] Nabil A. Khabbaz. A Geometric Hierarchy of Languages , 1974, J. Comput. Syst. Sci..
[12] Alfred V. Aho,et al. Indexed Grammars—An Extension of Context-Free Grammars , 1967, SWAT.
[13] Joost Engelfriet,et al. IO and OI. I , 1977, J. Comput. Syst. Sci..
[14] Karel Čnulík. On some families of languages related to developmental systems , 1974 .
[15] Peter R.J. Asveld,et al. Controlled Iteration Grammars and Full Hyper-AFL's , 1977, Inf. Control..
[16] Werner Damm,et al. The IO- and OI-Hierarchies , 1982, Theor. Comput. Sci..
[17] Joost Engelfriet,et al. Pushdown Machines for the Macro Tree Transducer , 1986, Theor. Comput. Sci..
[18] Jan van Leeuwen,et al. Variations of a New Machine Model , 1976, FOCS.
[19] Joost Engelfriet,et al. Characterization of High Level Tree Transducers , 1985, ICALP.
[20] Sheila A. Greibach. Full AFLs and Nested Iterated Substitution , 1970, Inf. Control..
[21] J. Engelfriet,et al. IO and OI , 1975 .