Free Access
Issue |
RAIRO. Inform. théor.
Volume 11, Number 1, 1977
|
|
---|---|---|
Page(s) | 53 - 62 | |
DOI | https://doi.org/10.1051/ita/1977110100531 | |
Published online | 01 February 2017 |
- 1. H. ALT and K. MEHLHORN, Lower Bounds for the Space Complexity of Context-Free Recognition, unpublished manuscript. [Zbl: 0368.68069] [Google Scholar]
- 2. R. BOOK, On the Chomsky-Schützenberger Theorem, Technical Report, Department of Computer Science, Yale University, New Haven, Conn., 1975. [Google Scholar]
- 3. R. BOOK and S. GREIBACH, Quasirealtime Languages, Math. Systems Theory, Vol. 4, 1970, pp. 97-111. [MR: 276019] [Zbl: 0188.33102] [Google Scholar]
- 4. R. BOOK, M. NIVAT and M. PATERSON, Reversal-Bounded Acceptors and Intersections of Linear Languages, SIAM J. Comput., Vol. 3, 1974, pp. 283-295. [MR: 433992] [Zbl: 0292.68023] [Google Scholar]
- 5. P. FISCHER, A. MEYER and A. ROSENBERG, Counter Machines and Counter Languages, Math. Systems Theory, Vol. 2, 1968, pp. 265-283. [MR: 235932] [Zbl: 0165.32002] [Google Scholar]
- 6. S. GINSBURG and S. GREIBACH, Abstract Families of Languages, Memoir 87, American Mathematical Society, Providence, R.I., 1969, pp. 1-32. [Zbl: 0194.31402] [MR: 297491] [Google Scholar]
- 7. S. GINSBURG, S. GREIBACH and J. HOPCROFT, Pre-AFL, Memoir 87, American Mathematical Society, Providence, R.I., 1969, pp. 41-51. [MR: 297493] [Zbl: 0194.31402] [Google Scholar]
- 8. S. GREIBACH, An Infinite Hierarchy of Context-Free Languages, J. Assoc. Computing Machinery, Vol. 16, 1969, pp. 91-106. [MR: 238632] [Zbl: 0182.02002] [Google Scholar]
- 9. G. HOTZ and J. MESSERSCHMIDT, Dyck-Sprachen sind in Bandkomplexitat log n analysierbar, Technical Report, Universität des Saarlandes, 1975. [Google Scholar]
- 10. N. JONES, Context-Free Languages and Rudimentary Attributes, Math. Systems Theory, Vol. 3, 1969, pp. 102-109. [MR: 265084] [Zbl: 0179.02202] [Google Scholar]
- 11. M. LATTEUX, Cônes rationnels commutativement clos, This Journal. [MR: 478782] [Zbl: 0354.68103] [Google Scholar]
- 12. M. MINSKY, Recursive Unsolvability of Post's Problem of Tag and other Topics in the Theory of Turing Machines, Annals of Math., Vol. 74, 1961, pp. 437-455. [MR: 140405] [Zbl: 0105.00802] [Google Scholar]
- 13. R. RITCHIE, and F. SPRINGSTEEL, Language Recognition by Marking Automata, Inf. and Control, Vol. 20, 1972, pp. 313-330. [MR: 325300] [Zbl: 0242.68032] [Google Scholar]
- 14. C. WRATHALL, Subrecursive Predicates and Automata, Research Report 56, Department of Computer Science, Yale University, New Haven, Conn., 1975. [Google Scholar]
- 15. Y. YU, Rudimentary Relations and Formal Languages, Ph. D. dissertation, University of California, Berkeley, Calif., 1970. [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.