EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 27 / No 1 (1993) RAIRO-Theor. Inf. Appl., 27 1 (1993) 23-48 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 27, Number 1, 1993
Page(s) 23 - 48
DOI https://doi.org/10.1051/ita/1993270100231
Published online 01 February 2017
  1. 1. D. CAUCAL, Décidabilité de l'égalité des langages algébriques infinitaires simples, L.N.CS., Vol. 210, 1986, pp. 37-48. [MR: 827723] [Zbl: 0595.68072] [Google Scholar]
  2. 2. D. CAUCAL, A Fast Algorithm to Decide on Simple Grammars Equivalence, L.N.C.S., Vol. 401 1989, pp. 66-85. [MR: 1048156] [Zbl: 0704.68072] [Google Scholar]
  3. 3. B. COURCELLE, An Axiomatic Approach to the KH Algorithms, Math. Systems Theory, Vol. 16, 1983, pp. 191-231. [MR: 702448] [Zbl: 0581.68032] [Google Scholar]
  4. 4. B. COURCELLE and J. VUILLEMIN, Completeness Result for the Equivalence of Recursive Schemes, J.C.S.S., Vol. 12, 1976, pp. 179-197. [MR: 411225] [Zbl: 0342.68008] [Google Scholar]
  5. 5. M. HARRISON, Introduction to Formal Language Theory, Addison-Wesley, 1978. [MR: 526397] [Zbl: 0411.68058] [Google Scholar]
  6. 6. M. HARRISON, I. HAVEL and A. YEDUHAÏ, On Equivalence of Grammars Through Transformation Trees, T.C.S.,Vol. 9, 1979, pp. 191-231. [MR: 540555] [Zbl: 0409.68041] [Google Scholar]
  7. 7. A. KORENJAK and J. HOPCROFT, Simple Deterministic Languages, Seventh annual I.E.E.E. switching and automata theory conference, 1966, pp. 36-46 [Google Scholar]
  8. 8. T. OLSHANSKY and A. PNUELI, A Direct Algorithm for Checking Equivalence of LL(k) Grammars, T.C.S., Vol. 4, 1977, pp. 321-349. [MR: 461996] [Zbl: 0358.68118] [Google Scholar]
  9. 9. M. OYAMAGUCHI and N. HONDA, The Decidability of Equivalence for Deterministic Stateless Pushdown Automata, Information and Control, Vol. 38, 1978, pp. 367-376. [MR: 509559] [Zbl: 0393.68078] [Google Scholar]
  10. 10. E. TOMITA, An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata, T.C.S., Vol. 32, 1984, pp. 87-120 [MR: 761163] [Zbl: 0552.68065] [Google Scholar]
  11. 11. L. VALIANT, The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata, Information and Control, Vol. 25, 1974, pp. 123-153. [MR: 391591] [Zbl: 0285.68025] [Google Scholar]
  12. 12. L. VALIANT and M. PATERSON, Deterministic One-Counter Automata, J.C.S.S., Vol. 10, 1975, pp. 340-350. [MR: 379149] [Zbl: 0307.68038] [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.