Abstract
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.
Note: This work has been supported by the ATP contract 4275 of CNRS - The present paper is a shortened version of report AAI - 8081 (available on request).
Chapter PDF
References
B. COURCELLE: Une forme canonique pour les grammaires déterministes, RAIRO, R-1(1974) pp. 19–36
B. COURCELLE: A representation of trees by languages. Theor. Comput. Sci. 6(1978) 255–279 and 7 (1978), 25–55.
B. COURCELLE: Infinite trees in normal form and recursive equations having a unique solution. Math. Systems Theory 13 (1979), 131–180
B. COURCELLE, P. FRANCHI-ZANNETTACCI: On the equivalence problem of attribute systems. Report AAI-80 Univ. of Bordeaux-I, 1980
B. COURCELLE, J. VUILLEMIN: Completeness results for the equivalence of recursive schemas. J. Comput. System Sci. 12 (1976), 179–197
J. DARLINGTON, R. BURSTALL: A system which automatically improves programs. Acta Informatica 6 (1976), 41–60
J. ENGELFRIET: Bottom-up and Top-down tree transformations, a comparison. Math. Systems Theory, 9 (1975), 198–231.
J. ENGELFRIET: Top-down transducers with regular look-ahead, Math. Systems Theory 10 (1977) 289–303
Z. ESIK: On functional tree-transducers, FCT Symposium 1979
E. FRIEDMAN: Equivalence problems for deterministic CFL and monadic recursion schemes, J. Comput. System Sci. 14 (1977) 344–359
M. HARRISON, I. HAVEL, A. YEHUDAI: On equivalence of grammars through transformation trees, Theor. Comput. Sci. 9 (1979) 173–205
G. HUET, B. LANG: Proving and applying program transformations expressed with 2nd order patterns, Acta Informatica 11 (1978) 31–55
A. KORENJAK, J. HOPCROFT: Simple deterministic languages. 7th IEEE Annual Symp. on Swithing and Automata Theory, Berkeley, California (1966) 36–46
M. OYAMAGUCHI, N. HONDA, Y. INAGAKI: The equivalence problem for real-time strict deterministic languages, Information and Control 45 (1980) 90–115.
T. OLSHANSKY, A. PNUELI: A direct algorithm for checking equivalence of LL(k)-grammars, Theor. Comput. Sci. 4 (1977) 321–349.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Courcelle, B. (1981). An axiomatic approach to the Korenjak - Hopcroft algorithms. In: Even, S., Kariv, O. (eds) Automata, Languages and Programming. ICALP 1981. Lecture Notes in Computer Science, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10843-2_32
Download citation
DOI: https://doi.org/10.1007/3-540-10843-2_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10843-6
Online ISBN: 978-3-540-38745-9
eBook Packages: Springer Book Archive