An axiomatic approach to the Korenjak - Hopcroft algorithms

  • B. Courcelle
Session 13: A. Salomaa, Chairman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 115)


There exist many equivalence decision algorithms for classes of grammars, program schemes, transducers which follow the general pattern of the Korenjak-Hopcroft algorithm for deciding the equivalence of simple deterministic grammars. An axiomatic framework is presented which points out the essence of the Korenjak-Hopcroft algorithm and applies to numerous situations.


  1. (C 74).
    B. COURCELLE: Une forme canonique pour les grammaires déterministes, RAIRO, R-1(1974) pp. 19–36Google Scholar
  2. (C 78).
    B. COURCELLE: A representation of trees by languages. Theor. Comput. Sci. 6(1978) 255–279 and 7 (1978), 25–55.Google Scholar
  3. (C79).
    B. COURCELLE: Infinite trees in normal form and recursive equations having a unique solution. Math. Systems Theory 13 (1979), 131–180Google Scholar
  4. (CF 80).
    B. COURCELLE, P. FRANCHI-ZANNETTACCI: On the equivalence problem of attribute systems. Report AAI-80 Univ. of Bordeaux-I, 1980Google Scholar
  5. (CV 76).
    B. COURCELLE, J. VUILLEMIN: Completeness results for the equivalence of recursive schemas. J. Comput. System Sci. 12 (1976), 179–197Google Scholar
  6. (DB 76).
    J. DARLINGTON, R. BURSTALL: A system which automatically improves programs. Acta Informatica 6 (1976), 41–60Google Scholar
  7. (E 75).
    J. ENGELFRIET: Bottom-up and Top-down tree transformations, a comparison. Math. Systems Theory, 9 (1975), 198–231.Google Scholar
  8. (E 77).
    J. ENGELFRIET: Top-down transducers with regular look-ahead, Math. Systems Theory 10 (1977) 289–303Google Scholar
  9. (Es 79).
    Z. ESIK: On functional tree-transducers, FCT Symposium 1979Google Scholar
  10. (F 77).
    E. FRIEDMAN: Equivalence problems for deterministic CFL and monadic recursion schemes, J. Comput. System Sci. 14 (1977) 344–359Google Scholar
  11. (HHY 79).
    M. HARRISON, I. HAVEL, A. YEHUDAI: On equivalence of grammars through transformation trees, Theor. Comput. Sci. 9 (1979) 173–205Google Scholar
  12. (HL 78).
    G. HUET, B. LANG: Proving and applying program transformations expressed with 2nd order patterns, Acta Informatica 11 (1978) 31–55Google Scholar
  13. (KH 66).
    A. KORENJAK, J. HOPCROFT: Simple deterministic languages. 7th IEEE Annual Symp. on Swithing and Automata Theory, Berkeley, California (1966) 36–46Google Scholar
  14. (OIH 80).
    M. OYAMAGUCHI, N. HONDA, Y. INAGAKI: The equivalence problem for real-time strict deterministic languages, Information and Control 45 (1980) 90–115.Google Scholar
  15. (OP 77).
    T. OLSHANSKY, A. PNUELI: A direct algorithm for checking equivalence of LL(k)-grammars, Theor. Comput. Sci. 4 (1977) 321–349.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • B. Courcelle
    • 1
  1. 1.U.E.R. de Mathématiques-InformatiqueUniversité de Bordeaux ITalenceFrance

Personalised recommendations