EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 21 / No 3 (1987) RAIRO-Theor. Inf. Appl., 21 3 (1987) 245-286 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 21, Number 3, 1987
Page(s) 245 - 286
DOI https://doi.org/10.1051/ita/1987210302451
Published online 01 February 2017
  1. 1. C. BEERI, An Improvement on Valiant's Decision Procedure for Equivalence of Deterministic Finite-Turn Pushdown Machines, Theoret. Comput. Sci., Vol. 3, 1976, pp. 305-320. [MR: 443436] [Zbl: 0361.68082] [Google Scholar]
  2. 2. D. CAUCAL, Décidabilité de l'égalité des languages algébriques infinitaires simples, 3rd Symposium on Theoretical Aspects of Computer Science, L.N.C.S., Vol. 210, Springer Verlag, 1986. [MR: 827723] [Zbl: 0595.68072] [Google Scholar]
  3. 3. B. COURCELLE, On Jump-Deterministic Pushdown Automata, Math. Systems Theory, Vol. 11, 1977, pp. 87-109. [MR: 464717] [Zbl: 0365.02021] [Google Scholar]
  4. 4. B. COURCELLE, A Representation of Trees by Languages I, Theoret. Comput. Sci., Vol. 6, 1978, pp. 255-279. [MR: 495225] [Zbl: 0377.68040] [Google Scholar]
  5. 5. B. COURCELLE, A Representation of Trees by Languages II, Theoret. Comput. Sci., Vol. 7, 1978, pp. 25-55. [MR: 495226] [Zbl: 0428.68088] [Google Scholar]
  6. 6. B. COURCELLE and J. VUILLEMIN. Completeness Results for the Equivalence of Recursive Schemes, J. Comput. System Sci., Vol. 12, (2), 1976, pp. 179-197. [MR: 411225] [Zbl: 0342.68008] [Google Scholar]
  7. 7. B. COURCELLE, Fundamental Properties of Infinite Trees, Theoret. Comput. Sci., Vol. 25, (2), 1983, pp. 95-170. [MR: 693076] [Zbl: 0521.68013] [Google Scholar]
  8. 8. J. ENGELFRIET and E. SCHMIDT, IO and OI, I and II, J. Comput. System Sci., Vol. 15, (3), 1977, and Vol. 16, (1), 1978, pp. 328-353 and 67-99. [MR: 502290] [Zbl: 0366.68053] [Google Scholar]
  9. 9. E. P. FRIEDMAN, Equivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes, J. Comput. System Sci., Vol. 14, 1977, pp.344-359. [MR: 443445] [Zbl: 0358.68109] [Google Scholar]
  10. 10. J. H. GALLIER, DPD A'S in "Atomic Normal Form" and Applications to Equivalence Problems, Theoret. Comput. Sci., Vol. 14, 1981 and Vol. 19, 1982, pp. 155-188 and 229. [Zbl: 0474.68065] [Google Scholar]
  11. 11. S. GINSBURG and E. SPANIER, Finite-Turn Pushdown Automata, S.I.A.M. J. on Control, Vol. 4, (3), 1966, pp. 429-453. [MR: 204294] [Zbl: 0147.25302] [Google Scholar]
  12. 12. J. GOGUEN, J. THATCHER, E. WAGNER and J. WRIGHT, Initial Algebra Semantics, J.A.C.M., Vol. 24, 1977, pp. 68-95. [MR: 520711] [Zbl: 0359.68018] [Google Scholar]
  13. 13. S. GORN, Explicit Definitions and Linguistic Dominoes, in J. HART and S. TAKASU, Eds., Systems and Computer Science, University of Toronto Press, 1965. [MR: 237245] [Google Scholar]
  14. 14. I. GUESSARIAN, Algebraic Semantics, L.N.C.S., Vol. 99. Springer Verlag, 1981. [MR: 617908] [Zbl: 0474.68010] [Google Scholar]
  15. 15. M. A. HARRISON, Introduction to Formal Language Theory, Addison Wesley, Reading, Mass, 1978. [MR: 526397] [Zbl: 0411.68058] [Google Scholar]
  16. 16. M. A. HARRISON and I. M. HAVEL, Strict Deterministic Grammars, J. Comput. System Sci., Vol. 7, 1973, pp. 237-277. [MR: 319415] [Zbl: 0261.68036] [Google Scholar]
  17. 17. M. A. HARRISON and I. M. HAVEL, Realtime Strict Deterministic Languages, S.I.A.M. J. on Comput., Vol. 1, 1972, pp. 333-349. [MR: 323164] [Zbl: 0267.68034] [Google Scholar]
  18. 18. M. A. HARRISON and I. M. HAVEL, On the Parsing of Deterministic Languages, J.A.C.M., Vol. 21, 1974, pp. 525-548. [MR: 356589] [Zbl: 0296.68084] [Google Scholar]
  19. 19. M. NIVAT, On the Interpretation of Recursive Polyadic Program Schemes, Symposia Mathematica, Vol. 15, Academic Press, New York, 1975, pp. 255-281. [MR: 391563] [Zbl: 0346.68041] [Google Scholar]
  20. 20. 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]
  21. 21. M. OYAMAGUCHI, Y. INAGAKI and N. HONDA, The Equivalence Problem for Real-Time Strict Deterministic Languages, Information and Control, Vol. 45, 1980, pp. 367-376. [MR: 582147] [Zbl: 0393.68078] [Google Scholar]
  22. 22. M. OYAMAGUCHI, Y. INAGAKI and N. HONDA, The Equivalence Problem for Two DPD A's One of which is a Finite-Turn or One-Counter Machine, J. Comput. System Sci., Vol. 23, (3), 1981, pp. 366-382. [MR: 644735] [Zbl: 0473.68046] [Google Scholar]
  23. 23. M. OYAMAGUCHI, The Equivalence Problem for Real-Time DPD A's, submitted for publication, 1986. [MR: 904202] [Zbl: 0637.68094] [Google Scholar]
  24. 24. L. G. VALIANT, Decision Procedures for Families of Deterministic Pushdown automata, Ph. D. thesis, University of Warwick, U.K., 1973. [Google Scholar]
  25. 25. L. G. VALIANT, The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata, Information and Control, Vol. 25, 1975, pp. 123-133. [MR: 391591] [Zbl: 0285.68025] [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.