SOME OPEN QUESTIONS AND RECENT RESULTS ON TREE TRANSDUCERS AND TREE LANGUAGES
暂无分享,去创建一个
[1] Meera Blattner. Single-Valued a-Transducers , 1977, J. Comput. Syst. Sci..
[2] Zoltán Ésik. On functional tree transducers , 1979, FCT.
[3] Michael J. Fischer,et al. Grammars with Macro-Like Productions , 1968, SWAT.
[4] Michael J. Fischer. Two Characterizations of the Context-Sensitive Languages , 1969, SWAT.
[5] Arto Salomaa,et al. On the Decidability of Homomorphism Equivalence for Languages , 1978, J. Comput. Syst. Sci..
[6] William A. Woods,et al. Computational Linguistics Transition Network Grammars for Natural Language Analysis , 2022 .
[7] Joost Engelfriet,et al. Tree transducers, L systems and two-way machines (Extended Abstract) , 1978, J. Comput. Syst. Sci..
[8] Jesse B. Wright,et al. Algebraic Automata and Context-Free Sets , 1967, Inf. Control..
[9] David F. Martin,et al. An algebraic formulation of knuthian semantics , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).
[10] Max Dauchet,et al. Sul l'inversion des morphisms d'arbres , 1978, ICALP.
[11] Rainer Parchmann,et al. Szilard Languages of IO-Grammars , 1979, Inf. Control..
[12] C. Raymond Perrault. Intercalation Lemmas for Tree Transducer Languages , 1976, J. Comput. Syst. Sci..
[13] T. S. E. Maibaum,et al. A Generalized Approach to Formal Languages , 1974, J. Comput. Syst. Sci..
[14] Werner Damm. An Algebraic Extension of the Chomsky-Hierarchy , 1979, MFCS.
[15] Malcolm Bird,et al. The Equivalence Problem for Deterministic Two-Tape Automata , 1973, J. Comput. Syst. Sci..
[16] Werner Damm,et al. On the Power of Self-Application and Higher Type-Recursion , 1978, ICALP.
[17] Alfred V. Aho,et al. Translations on a Context-Free Grammar , 1971, Inf. Control..
[18] Max Dauchet,et al. Bi-transductions de forêts , 1976, International Colloquium on Automata, Languages and Programming.
[19] Mitchell Wand,et al. An algebraic formulation of the Chomsky hierarchy , 1974, Category Theory Applied to Computation and Control.
[20] Rainer Parchmann,et al. IO-Macrolanguages and Attributed Translations , 1977, Inf. Control..
[21] J. Engelfriet,et al. IO and OI , 1975 .
[22] Walter L. Ruzzo,et al. Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..
[23] Timothy V. Griffiths. The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines , 1968, JACM.
[24] Max Dauchet,et al. Forêts Algébriques et Homomorphismes Inverses , 1978, Inf. Control..
[25] Brenda S. Baker. Generalized Syntax Directed Translation, Tree Transducers, and Linear Space , 1978, SIAM J. Comput..
[26] Ken Kennedy,et al. Automatic generation of efficient evaluators for attribute grammars , 1976, POPL.
[27] Karel Culik,et al. The Decidability of the Equivalence Problem for DOL-Systems , 1977, Inf. Control..
[28] Oscar H. Ibarra,et al. Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata , 1971, J. Comput. Syst. Sci..
[29] Joost Engelfriet,et al. IO and OI. I , 1977, J. Comput. Syst. Sci..
[30] Daniel J. Rosenkrantz,et al. Attributed Translations , 1974, J. Comput. Syst. Sci..
[31] Z. Zachar,et al. The solvability of the equivalence problem for deterministic frontier-to-root tree transducers , 1979, Acta Cybern..
[32] M. Nivat. On the interpretation of recursive program schemes , 1974 .
[33] Anatoliy O. Buda,et al. Generalized1.5 Sequential Machine Maps , 1979, Inf. Process. Lett..
[34] Brenda S. Baker,et al. Tree Transducers and Tree Languages , 1978, Inf. Control..
[35] Brenda S. Baker,et al. Composition of Top-Down and Bottom-Up Tree Transductions , 1979, Inf. Control..
[36] Werner Damm,et al. Higher Type Recursion and Self-Application as Control Structures , 1977, Formal Description of Programming Concepts.
[37] Joost Engelfriet,et al. Bounded Nesting in Macro Grammars , 1979, Inf. Control..
[38] Gregor von Bochmann,et al. Semantic evaluation from left to right , 1976, CACM.
[39] james w.thatcher,et al. tree automata: an informal survey , 1974 .
[40] Richard J. Lipton,et al. Alternating Pushdown Automata (Preliminary Report) , 1978, FOCS.
[41] Joseph A. Goguen,et al. Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.
[42] Jan van Leeuwen,et al. Stack Machines and Classes of Nonnested Macro Languages , 1980, JACM.