Citation: A. Ehrenfeucht et al., ON REPRESENTING RECURSIVELY-ENUMERABLE LANGUAGES BY INTERNAL CONTEXTUAL LANGUAGES, Theoretical computer science, 205(1-2), 1998, pp. 61-83
Citation: A. Ehrenfeucht et al., FINITE LANGUAGES FOR THE REPRESENTATION OF FINITE GRAPHS, Journal of computer and system sciences, 52(1), 1996, pp. 170-184
Citation: A. Ehrenfeucht et R. Mcconnell, A K-STRUCTURE GENERALIZATION OF THE THEORY OF 2-STRUCTURES, Theoretical computer science, 132(1-2), 1994, pp. 209-227
Authors:
EHRENFEUCHT A
GABOW HN
MCCONNELL RM
SULLIVAN SJ
Citation: A. Ehrenfeucht et al., AN O[N(2)] DIVIDE-AND-CONQUER ALGORITHM FOR THE PRIME TREE DECOMPOSITION OF 2-STRUCTURES AND MODULAR DECOMPOSITION OF GRAPHS, Journal of algorithms, 16(2), 1994, pp. 283-294
Citation: A. Apostolico et A. Ehrenfeucht, EFFICIENT DETECTION OF QUASIPERIODICITIES IN STRINGS, Theoretical computer science, 119(2), 1993, pp. 247-265