EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 9 / No R2 (1975) R.A.I.R.O. Informatique théorique, 9 R2 (1975) 5-12 References
Free Access
Issue
R.A.I.R.O. Informatique théorique
Volume 9, Number R2, 1975
Page(s) 5 - 12
DOI https://doi.org/10.1051/ita/197509R200051
Published online 01 February 2017
  1. [1]D. H. YOUNGER, Recognition and parsing of context-free languages in time n3, Information and Control, (1967), 10, 189-208. [Zbl: 0149.24803] [Google Scholar]
  2. [2]P. M. LEWIS, R. E. STEARNS and J. HARTMANIS, Memory bounds for recognition of context-free and context-sensitive languages, IEEE Conference Record on Switching Circuit Theory and Logical Design, Ann. Arbor, Michigan, 1965, 191-202. [Zbl: 0272.68054] [Google Scholar]
  3. S. A. GREIBACH, The Hardest Context-free Language, SIAM J. Computing, (1973), 2, 304-310. [Zbl: 0278.68073] [Google Scholar]
  4. T. KASAMI, A note on computing time for recognition of languages generated by linear grammars, Information and Control, (1967), 10, 209-214. [Zbl: 0163.01002] [Google Scholar]
  5. A. V. AHO, J. E. HOPCROFT and J. D. ULLMAN, Time and tape complexity of pushdown automaton languages, Information and Control, (1968), 13, 186-206. [Zbl: 0257.68065] [Google Scholar]
  6. P. C. FISCHER, A. R. MEYER and A. L. ROSENBERG, Counter machines and counter languages, Math Systems Theory, (1968), 2. 265-283. [Zbl: 0165.32002] [Google Scholar]
  7. S. A. GREIBACH, Erasable context-free languagse, to appear. [Zbl: 0317.68059] [Google Scholar]
  8. S. GINSBURG, and G. F. ROSE, The equivalence of stack counter acceptors and quasi-realtime acceptors, J. Computer System Science, (1974), 8, 243-269. [Zbl: 0275.68017] [Google Scholar]
  9. S. GINSBURG, and S. GREIBACH, Deterministic context-free languages, Information and Control, (1966), 9, 620-648. [Zbl: 0145.00802] [Google Scholar]
  10. O. H. IBARRA, On two-way multihead automata, Computer System Sciences, (1973), 7, 28-36. [Zbl: 0256.68028] [Google Scholar]
  11. S. GREIBACH, Remarks on the complexity of nondeterministic counter languages, to appear. [Zbl: 0332.68039] [Google Scholar]
  12. S. GINSBURG, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966. [Zbl: 0184.28401] [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.