EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 16 / No 2 (1982) RAIRO. Inform. théor., 16 2 (1982) 129-138 References
Free Access
Issue
RAIRO. Inform. théor.
Volume 16, Number 2, 1982
Page(s) 129 - 138
DOI https://doi.org/10.1051/ita/1982160201291
Published online 01 February 2017
  1. 1.J. M. AUTEBERT, G. COUSINEAU etM. NIVAT, Les Langages Algébriques, Hermann, Paris (à paraître). [Google Scholar]
  2. 2. L. BOASSON, Un LangageAlgébrique Particulier, R.A.I.R.O., Informatique théorique, vol. 13, 1979, p. 203-215. [EuDML: 92099] [MR: 554682] [Zbl: 0424.68042] [Google Scholar]
  3. 4. E. FRIEDMANN, The Inclusion Problem for Simple Languages, Theoretical Computer Science, vol. 1, 1976, p. 297-316. [MR: 405936] [Zbl: 0349.68032] [Google Scholar]
  4. 5. C. FROUGNY, Langages très Simples Générateurs, R.A.I.R.O., Informatique Théorique, vol. 13, 1976, p. 69-86. [EuDML: 92091] [MR: 525458] [Zbl: 0405.68063] [Google Scholar]
  5. 6. S. GINSBURG, The Mathematical Theory of Context-free Languages, Mc Graw Hill, 1966. [MR: 211815] [Zbl: 0184.28401] [Google Scholar]
  6. 7. S. GINSBURG et E.H. SPANIER, Finite-Turn Pushdown Automata, S.I.A.M. J. Control, vol. 4, 1966, p. 429-453. [MR: 204294] [Zbl: 0147.25302] [Google Scholar]
  7. 8. S. A. GREIBACH, The Unsolvability of the Recognition of Linear Context-Free Languages, J. Assoc. Comp. Mach., vol. 13, 1966, p. 582-588. [MR: 205770] [Zbl: 0148.00901] [Google Scholar]
  8. 9. S. A. GREIBACH, One-Counter Languages and the IRS Condition, J. Comput System Sc., vol. 10, 1975, p. 237-247. [MR: 395352] [Zbl: 0307.68062] [Google Scholar]
  9. 10. S. A. GREIBACH et E. FRIEDMANN, Superdeterministics Pda's : a Subcase with a Decidable Equivalence Problem (à paraître). [Zbl: 0462.68030] [Google Scholar]
  10. 11. M. LATTEUX, Cônes Rationnels Commutativement Clos, R.A.I.R.O., Informatique Théorique, vol. 11, 1977, p. 29-51. [EuDML: 92040] [MR: 478782] [Zbl: 0354.68103] [Google Scholar]
  11. 12. R. E. STEARNS, A Regularity Test for Pushdown Machines, Information and Control, vol. 11, 1967, p. 323-340. [Zbl: 0155.01901] [Google Scholar]
  12. 13. L. G. VALIANT, The Equivalence Problem for Deterministic Finite-Turn Pushdow Automata, Information and Control, vol. 25, 1974, p. 123-133. [MR: 391591] [Zbl: 0285.68025] [Google Scholar]
  13. 14. L. G. VALIANT, Decision Procedures for Families of Deterministic Pushdown Automata, Ph. D. Thesis, University of Warwick, 1973. [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.