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.
Cite
CITATION STYLE
Courcelle, B. (1981). An axiomatic approach to the Korenjak - Hopcroft algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 115 LNCS, pp. 393–407). Springer Verlag. https://doi.org/10.1007/3-540-10843-2_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
