Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages

Fixed point languages and equality languages of homomorphisms and dgsm mappings are consid- ered. Some basic properties of these classes of languages are proved, and it is shown how to use them to represent recursively enumerable sets. In particular, very simple languages are introduced which play the same role for the class of recursively enumerable languages that the Dyck languages play for the class of context-free languages. Finally, a new type of acceptor for defining equality languages is introduced. KEY WOADS AND PHRASES: equality language, fLxed point language, recursively enumerable language, determin- istic sequential machine, Turing machine, Post correspondence problem, shuffle, AFL generator, representation of languages

[1]  Seymour Ginsburg,et al.  A Note on Preservation of Languages by Transducers , 1968, Inf. Control..

[2]  Andrzej Ehrenfeucht,et al.  Elementary Homomorphisms and a Solution of the D0L Sequence Equivalence Problem , 1978, Theor. Comput. Sci..

[3]  Alfred V. Aho,et al.  A Characterization of Two-Way Deterministic Classes of Languages , 1969, J. Comput. Syst. Sci..

[4]  Gerald A. Fischer,et al.  On the Representation of Formal Languages Using Automata on Networks , 1969, SWAT.

[5]  Juris Hartmanis.  Context-free languages and turing machine computations , 1967 .

[6]  Michael J. Fischer,et al.  Grammars with Macro-Like Productions , 1968, SWAT.

[7]  Paul M. B. Vitányi,et al.  On Inverse Deterministic Pushdown Transductions , 1978, J. Comput. Syst. Sci..

[8]  Timothy V. Griffiths.  Some Remarks on Derivations in General Rewriting Systems , 1968, Inf. Control..

[9]  S. Ginsburg,et al.  Finite-Turn Pushdown Automata , 1966 .

[10]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[11]  Juris Hartmanis,et al.  What makes Some Language Theory Problems Undecidable , 1970, J. Comput. Syst. Sci..

[12]  Karel Culik.  A Purely Homomorphic Characterization of Recursively Enumerable Sets , 1979, JACM.

[13]  Sheila A. Greibach,et al.  Comparisons and Reset Machines (Preliminary Report) , 1978, ICALP.

[14]  Arnold L. Rosenberg.  On multi-head finite automata , 1965, SWCT.

[15]  Maurice Nivat,et al.  Transduction des langages de Chomsky , 1968 .

[16]  Joost Engelfriet,et al.  Equality Languages and Fixed Point Languages , 1979, Inf. Control..

[17]  Arto Salomaa.  Equality sets for homomorphisms of free monoids , 1978, Acta Cybern..

[18]  Sheila A. Greibach,et al.  The Hardest Context-Free Language , 1973, SIAM J. Comput..

[19]  Arto Salomaa,et al.  On the Decidability of Homomorphism Equivalence for Languages , 1978, J. Comput. Syst. Sci..

[20]  Alfred V. Aho,et al.  Indexed Grammars—An Extension of Context-Free Grammars , 1967, SWAT.

[21]  Walter J. Savitch,et al.  How to Make Arbitrary Grammars Look Like Context-Free Grammars , 1973, SIAM J. Comput..

[22]  Alfred V. Aho,et al.  A Characterization of Two-Way Deterministic Classes of Languages , 1970, J. Comput. Syst. Sci..

[23]  Seymour Ginsburg,et al.  Stack automata and compiling , 1967, JACM.

[24]  Seymour Ginsburg,et al.  Preservation of Languages by Transducers , 1966, Inf. Control..

[25]  Gabor T. Herman,et al.  Context free languages in biological systems , 1974 .

[26]  Karel Culik,et al.  The Decidability of the Equivalence Problem for DOL-Systems , 1977, Inf. Control..

[27]  Seymour Ginsburg,et al.  Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .

[28]  Journal of the Association for Computing Machinery , 1961, Nature.

[29]  Adrian Walker,et al.  On the Stability of some Biological Schemes with Cellular Interactions , 1976, Theor. Comput. Sci..

[30]  John E. Hopcroft,et al.  Simple Deterministic Languages , 1966, SWAT.

[31]  Sheila A. Greibach.  Visits, Crosses, and Reversals for Nondeterministic Off-Line Machines , 1978, Inf. Control..

[32]  Karel Culik.  Some Decidability Results About Regular and Pushdown Translations , 1979, Inf. Process. Lett..