EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 17 / No 2 (1983) RAIRO. Inform. théor., 17 2 (1983) 121-130 References
Free Access
Issue
RAIRO. Inform. théor.
Volume 17, Number 2, 1983
Page(s) 121 - 130
DOI https://doi.org/10.1051/ita/1983170201211
Published online 01 February 2017
  1. 1. A. V. AHO and J. D. ULLMAN, The Theory of Parsing, Translation and Compiling, Vol. 1, Prentice-Hall, Englewood Cliffs N.J., 1972. [Zbl: 0264.68032] [MR: 408321] [Google Scholar]
  2. 2. B. S. BAKER and R. V. BOOK, Reversal-Bounded Multipushdown Machines, J. Comp. System Sc., Vol. 8, 1974, pp. 315-332. [MR: 375844] [Zbl: 0309.68043] [Google Scholar]
  3. 3. R. V. BOOK, Translational Lemmas, Polynomial Time and (log n) j-Space, Theor. Comp. Sc., 1976, pp. 215-226. [MR: 405918] [Zbl: 0326.68030] [Google Scholar]
  4. 4. R. V. BOOK, Complexity Classes of Formal Languages, MFCS, 1979, pp. 43-56, Lecture Notes in Comp. Sc., No. 74. [MR: 570974] [Zbl: 0413.68045] [Google Scholar]
  5. 5. R. V. BOOK and F.-J. BRANDENBURG, Equality Sets and Complexity Classes, S.I.A.M. J. Computing, Vol. 9, No. 4, 1980, pp. 729-743. [MR: 592764] [Zbl: 0446.68040] [Google Scholar]
  6. 6. R. V. BOOK and S. A. GREIBACH, Quasi-Realtime Languages, Math. Syst. Theory, Vol. 4, No. 2, 1970, pp. 97-111. [MR: 276019] [Zbl: 0188.33102] [Google Scholar]
  7. 7. R. V. BOOK, S. A. GREIBACH and B. WEGBREIT, Time- and Tape-Bouded Turing Acceptors and AFLs, J. Comp. System Sc., Vol. 4, No. 6, 1970, pp. 606-621. [MR: 267993] [Zbl: 0206.28702] [Google Scholar]
  8. 8. R. V. BOOK, M. NIVAT and M. PATERSON, Reversal-Bounded Acceptors and Intersections of Linear Languages, S.I.A.M. J. Computing, Vol. 3, No. 4, 1974, pp. 283-295. [MR: 433992] [Zbl: 0292.68023] [Google Scholar]
  9. 9. K. CULIK II, Homomorphisms; Decidability, Equality and Test Sets; Formal Language Theory, Perspectives and Open Problems, R. V. Book, Ed., Academic Press, 1980. [Google Scholar]
  10. 10. K. CULIK II and N. O. DIAMOND, A Homomorphic Characterization of Time and Space Complexity Classes of Languages, Internat. J. Computer Math. (to appear). [MR: 585410] [Zbl: 0444.68035] [Google Scholar]
  11. 11. P. C. FISCHER, A. R. MEYER and A. L. ROSENBERG, Counter Machines and Counter Languages, Math. Syst. Theory, Vol. 2, No. 3, 1968, pp. 265-283. [MR: 235932] [Zbl: 0165.32002] [Google Scholar]
  12. 12. S. GINSBURG, Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland, 1975. [MR: 443446] [Zbl: 0325.68002] [Google Scholar]
  13. 13. S. A GREIBACH, Remarks on the Complexity of Nondeterministic Counter Languages, Theor. Comp. Sc., Vol. 1, 1976, pp. 269-288. [MR: 411257] [Zbl: 0332.68039] [Google Scholar]
  14. 14. J. HARTMANIS, Context-Free Languages and Turing Machine Computations, Proc. Symp. Applied Math., Vol. 19, 1967, pp. 42-51. [MR: 235938] [Zbl: 0189.29101] [Google Scholar]
  15. 15. O. M. IBARRA, Characterizations of Transductions Deflned by Abstract Families of Transducers Math. Syst. Theory, Vol. 5, 1971, pp. 271-281. [MR: 305949] [Zbl: 0221.94077] [Google Scholar]
  16. 16. O. M. IBARRA, Characterization of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multi-Head and Auxiliary Stack Automata, J. Comput. System. Sc., Vol. 5, 1971, pp. 88-117. [MR: 284290] [Zbl: 0255.68012] [Google Scholar]
  17. 17. I. H. SUDBOROUGH, On the Tape Complexity of Deterministic Context-Free Languages, J. Assoc. Comp. Mach., Vol. 25, 1978, pp. 405-414. [MR: 498563] [Zbl: 0379.68054] [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.