Free Access
| Issue |
RAIRO-Theor. Inf. Appl.
Volume 25, Number 5, 1991
|
|
|---|---|---|
| Page(s) | 473 - 496 | |
| DOI | https://doi.org/10.1051/ita/1991250504731 | |
| Published online | 01 February 2017 | |
- 1. V. GEFFERT, A Representation of Recursively Enumerable Languages by two Homomorphisms and a Quotient, Theoret. Comput. Sci., 1988, 62, pp. 235-249. [MR: 980932] [Zbl: 0664.68075] [Google Scholar]
- 2. V. GEFFERT, Grammars with Context Dependency Restricted to Synchronization, Proc. of M.FC.S' 86, L.N.C.S., 1986, 233, Springer-Verlag, pp. 370-378. [MR: 874614] [Zbl: 0611.68050] [Google Scholar]
- 3. V. GEFFERT, 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. [MR: 1023435] [Zbl: 0652.68095] [Google Scholar]
- 4. S. GINSBURG, Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland, Amsterdam, 1975. [MR: 443446] [Zbl: 0325.68002] [Google Scholar]
- 5. M. A. HARRISON, Introduction to Formal Language Theory, Addison-Wesley, 1978. [MR: 526397] [Zbl: 0411.68058] [Google Scholar]
- 6. M. A. HARRISON and M. SCHOLNICK, A Grammatical Characterization of One Way Nondeterministic Stack Languages, Ibid., 1971, 18, pp. 148-172. [MR: 290902] [Zbl: 0274.68020] [Google Scholar]
- 7. J. E. HOPCROFT and J. D. ULLMAN, Formal Languages and Their Relation to Automata, Addison-Wesley, 1969. [MR: 237243] [Zbl: 0196.01701] [Google Scholar]
- 8. M. JANTZEN, M. KUDLEK, K. L. LANGE and H. PETERSEN, Dyck1-Reductions of Context-Free Languages, Comput. Artificial Intelligence, 1990, 9, No. 1, pp. 3-18. [MR: 1047742] [Zbl: 0695.68054] [Google Scholar]
- 9. E. POST, A Variant of a Recursively Unsolvable Problem, Bull. Amer. Math, Soc., 1946, 52, pp. 264-268. [MR: 15343] [Zbl: 0063.06329] [Google Scholar]
- 10. B. ROVAN, A Framework for Studying Gramars, Proc. of M.F.C.S' 81, L.N.C.S., 1981, 118, Springer-Verlag, pp. 473-482. [MR: 652779] [Zbl: 0491.68076] [Google Scholar]
- 11. B. ROVAN, Complexity Classes of g-Systems are AFL, Univ. Comeniana, Acta Math. Univ. Comenian., XLVIII-XLIX, 1986, pp. 283-297. [MR: 885343] [Zbl: 0639.68064] [Google Scholar]
- 12. E. S. SANTOS, A Note on Bracketed Grammars, J. Assoc. Comput. Mach., 1972, 9, pp. 222-224. [MR: 449050] [Zbl: 0238.68025] [Google Scholar]
- 13. W. J. SAVITCH, How to Make Arbitrary Grammars Look Like Context-Free Grammars, S.I.A.M. J. Comput., 2, No. 3, 1973. [MR: 356596] [Zbl: 0298.68057] [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.