Subject
General Computer Science,Theoretical Computer Science
Reference11 articles.
1. A purely homomorphic representation of recursively enumerable sets;Culik;J. ACM,1979
2. A homomorphic characterization of time and space complexity classes of languages;Culik;Internat. J. Comput. Math.,1980
3. Fixed point languages, equality languages and representation of recursively enumerable languages;Engelfriet;J. ACM,1980
4. Grammars with context dependency restricted to synchronization;Geffert,1986
5. Algebraic and Automata-theoretic Properties of Formal Languages;Ginsburg,1975
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Equality sets for recursively enumerable languages;RAIRO - Theoretical Informatics and Applications;2005-10
2. On Context-Sensitive Grammars;Formal Languages and Applications;2004
3. Characterizations of Language Classes;Topics in Computer Mathematics;2003-01-16
4. Morphisms;Handbook of Formal Languages;1997
5. Aspects of Classical Language Theory;Handbook of Formal Languages;1997