Reference10 articles.
1. J. Berstel, "Transductions and Context-Free Languages", Teubner 1979.
2. R. Book and F.J. Brandenburg, "Equality Sets and Complexity Classes" SIAM J. Comput. 9, 729–743, (1980).
3. F.J. Brandenburg, "Extended Chomsky-Schützenberger Theorems", Lecture Notes in Computer Science 140, 83–93, (1982).
4. F.J. Brandenburg, "Representations of language families by homomorphic equality operations and generalized equality sets", to appear in Theoret. Comput. Sci.
5. K. Culik II, "A purely homomorphic characterization of recursively emunerable sets", J. Assoc. Comput. Mach. 26, 345–350, (1979).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Some Characterization of Recursively Enumerable Sets;International Journal of Computer Mathematics;2002-01
2. Homomorphic Representations of Certain Classes of Languages;Advances in Algorithms, Languages, and Complexity;1997