Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
- 1 July 1980
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 27 (3) , 499-518
- https://doi.org/10.1145/322203.322211
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- A Purely Homomorphic Characterization of Recursively Enumerable SetsJournal of the ACM, 1979
- Some decidability results about regular and pushdown translationsInformation Processing Letters, 1979
- On the decidability of homomorphism equivalence for languagesJournal of Computer and System Sciences, 1978
- Elementary homomorphisms and a solution of the D0L sequence equivalence problemTheoretical Computer Science, 1978
- On the stability of some biological schemes with cellular interactionsTheoretical Computer Science, 1976
- Context free languages in biological systemsInternational Journal of Computer Mathematics, 1974
- Indexed Grammars—An Extension of Context-Free GrammarsJournal of the ACM, 1968
- Some remarks on derivations in general rewriting systemsInformation and Control, 1968
- Stack automata and compilingJournal of the ACM, 1967
- Preservation of languages by transducersInformation and Control, 1966