Subject
Computer Science Applications,General Mathematics,Software
Reference13 articles.
1. 1. GEFFERT V., A Representation of Recursively Enumerable Languages by two Homomorphisms and a Quotient, Theoret. Comput. Sci., 1988, 62, pp. 235-249.9809320664.68075
2. 2. GEFFERT V., Grammars with Context Dependency Restricted to Synchronization, Proc. of M.FC.S' 86, L.N.C.S., 1986, 233, Springer-Verlag, pp. 370-378.8746140611.68050
3. 3. GEFFERT V., Context-Free-Like Forms for the Phrase-Structure Grammars, Proc. of M.F.C.S.' 88, L.N.C.S., 1988, 324, Springer-Verlag, pp. 309-317.10234350652.68095
4. 4. GINSBURG S., Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland, Amsterdam, 1975.4434460325.68002
5. 5. HARRISON M. A., Introduction to Formal Language Theory, Addison-Wesley, 1978.5263970411.68058
Cited by
62 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献