Free Access
Issue
RAIRO. Inform. théor.
Volume 12, Number 4, 1978
Page(s) 369 - 385
DOI https://doi.org/10.1051/ita/1978120403691
Published online 01 February 2017
  1. 1. B. BAKER and R. BOOK, Reversal-bounded Multipushdown Machine, J. Comput. Syst. Sc., Vol. 8, 1974, pp. 315-332. [MR: 375844] [Zbl: 0309.68043]
  2. 2. R. BOOK, Simple Representations of Certain Classes of Languages, J. Assoc. Comput. Mach., Vol. 25, 1978, pp. 23-31. [MR: 461992] [Zbl: 0364.68073]
  3. 3. R. BOOK and S. GREIBACH, Quasirealtime Languages, Math. Syst. Theory, Vol. 4, 1970, pp. 97-111. [MR: 276019] [Zbl: 0188.33102]
  4. 4. R. BOOK, S. GREIBACH and C. WRATHALL, Comparison and Reset Machines, to be presented at 5th Intl. Golloq. Automata, Languages and Programming, Udine, Italy, 1978. [MR: 556604] [Zbl: 0388.03017]
  5. 5. R. BOOK M. NIVAT, Linear Languages and the Intersection Closures of Classes of Languages, SIAM J. Computing, Vol. 7, 1978, pp. 167-177. [MR: 492911] [Zbl: 0376.68049]
  6. 6. R. BOOK, M. NIVAT and M. PATERSON, Reversal-bounded Acceptors and Intersections of Linear Languages, SIAM J. Computing, Vol. 3, 1974, pp. 283-295. [MR: 433992] [Zbl: 0292.68023]
  7. 7. R. BOOK and B. WEGBREIT, A Note on AFLs and Bounded Erasing, Inform. and Control, Vol. 19, 1971, pp. 18-29. [MR: 319411] [Zbl: 0237.68021]
  8. 8. R. BOOK and C. WRATHALL, On Languages Specified by Relative Acceptance, Theoret. Comput. Sc., Vol. 7, 1978 (to appear). [MR: 509016] [Zbl: 0385.68061]
  9. 9. P. C. FISCHER, A. R. MEYER and A. L. ROSENBERG, Counter Machines and Counter Languages, Math. Syst. Theory, Vol. 2, 1968, pp. 265-283. [MR: 235932] [Zbl: 0165.32002]
  10. 10. S. GINSBURG and J. GOLDSTTNE, Intersection Closed full AFL and the Recursively Enumerables Languages, Inform. and Control, Vol. 22, 1973, pp. 201-231. [MR: 327087] [Zbl: 0267.68035]
  11. 11. S. GINSBURG and S. GREIBACH, Principal AFL, J. Comput. Syst. Sc., Vol. 4, 1970, pp. 308-338. [MR: 286599] [Zbl: 0198.03102]
  12. 12. S. GINSBURG, S. GREIBACH and M. A. HARRISON, One-way Stack Automata, J. Assoc. Comput. Mach., Vol. 14, 1967, pp. 389-418. [MR: 243944] [Zbl: 0171.14803]
  13. 13. S. GINSBURG and E. H. SPANIER, AFL with the Semilinear Property, J. Comput. Syst. Sc., Vol. 5, 1971, pp. 365-396. [MR: 339558] [Zbl: 0235.68029]
  14. 14. J. GOLDSTINE, Continuous Operations on Languages, Math. Syst. Theory, Vol. 11, 1977, pp. 29-46. [MR: 455567] [Zbl: 0364.68068]
  15. 15. S. GREIBACH, The Unsolvability of the Recognition of Linear Context-free Languages, J. Assoc Comput. Mach., Vol. 13, 1966, pp. 582-587. [MR: 205770] [Zbl: 0148.00901]
  16. 16. S. GREIBACH, An Infinite Hierarchy of Context-free Languages, J. Assoc. Comput. Mach., Vol. 16, 1969, pp. 91-106. [MR: 238632] [Zbl: 0182.02002]
  17. 17. S. GREIBACH, Erasing on Context-free AFLs, Inform. and Control, Vol. 21, 1972, pp. 436-465. [MR: 331876] [Zbl: 0248.68036]
  18. 18. S. GREIBACH, Syntactic Operators on Full semi AFLs, J. Comput. Syst. Sc., Vol. 6, 1972, pp. 30-76. [MR: 307535] [Zbl: 0269.68046]
  19. 19. S. GREIBACH, Remarks on the Complexity of Nondeterministic Counter Languages, Theoret. Comput. Sc., Vol. 1, 1976, pp. 269-288. [MR: 411257] [Zbl: 0332.68039]
  20. 20. S. GREIBACH, Control Sets on Context-free Grammar Forms, J. Comput. Syst. Sc., Vol. 15, 1977, pp. 35-98. [MR: 502294] [Zbl: 0359.68093]
  21. 21. S. GREIBACH, One-way Finite Visit Automata, Theoret. Comput. Sc, Vol. 6, 1978, pp. 175-221. [MR: 489039] [Zbl: 0368.68059]
  22. 22. S. GREIBACH, Remarks on Blind and Partially Blind Multicounter Machines, Theoret. Comput. Sc. (to appear). [Zbl: 0389.68030]
  23. 23. S. GREIBACH and S. GINSBURG, Multitape AFA, J. Assoc. Comput. Mach., Vol. 19, 1972, pp. 193-21. [MR: 300828] [Zbl: 0241.68031]
  24. 24. K. KLIGENSTEIN, Structures of Bounded Languages in Certain Classes of Languages, Inform. and Control (to appear).
  25. 25. K. KLINGENSTEIN, ρ-matrix Languages, Theoret. Comput. Sc. (to appear).
  26. 26. J. L. PETERSON, Computation Sequence Sets, J. Comput. Syst. Sc, Vol. 13, 1976, pp. 1-24. [MR: 411260] [Zbl: 0354.68100]
  27. 27. V. RAJLICH, Absolutely Parallel Grammars and two-way Finite-state Transducers, J. Comput. Syst. Sc, Vol. 6, 1972, pp. 324-342. [MR: 300833] [Zbl: 0246.68013]
  28. 28. V. RAJLICH, Bounded-crossing transducers, Inform. and Control, Vol. 27, 1975, pp. 329-335. [MR: 373377] [Zbl: 0297.68069]
  29. 29. J. I. SEIFERAS, M. J. FISCHER and A. R. MEYER, Separating Deterministic time Complexity Classes, J. Assoc. Comput. Mach., Vol. 25, 1978, pp. 146-167. [MR: 464703] [Zbl: 0366.68038]
  30. 30. G. S. SACERDOTE and R. L. TENNEY, The Dedidability of the Reachability Problem for Vector Addition Systems, Proc. 9th Annual Symposium on Theory of Computing, Boulder, Colorado, May 1977, pp. 61-76. [MR: 488989]
  31. 31. R. SIROMONEY, On Equal Matrix Languages, Inform. and Control, Vol. 14, 1969, pp. 135-151. [MR: 253838] [Zbl: 0169.31402]

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.