Very special languages and representations of recursively enumerable languages via computation histories
- 31 December 1980
- journal article
- Published by Elsevier in Information and Control
- Vol. 47 (3) , 201-212
- https://doi.org/10.1016/s0019-9958(80)90537-9
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable LanguagesJournal of the ACM, 1980
- The decidability of equivalence for deterministic finite transducersJournal of Computer and System Sciences, 1979
- On the decidability of homomorphism equivalence for languagesJournal of Computer and System Sciences, 1978
- k + 1 Heads Are Better than kJournal of the ACM, 1978
- Reversal-bounded multipushdown machinesJournal of Computer and System Sciences, 1974
- On AFL generators for finitely encoded AFAJournal of Computer and System Sciences, 1973
- Principal AFLJournal of Computer and System Sciences, 1970
- On Multi-Head Finite AutomataIBM Journal of Research and Development, 1966
- Computability of Recursive FunctionsJournal of the ACM, 1963