Citation: J. Cassaigne et J. Karhumaki, EXAMPLES OF UNDECIDABLE PROBLEMS FOR 2-GENERATOR MATRIX SEMIGROUPS, Theoretical computer science, 204(1-2), 1998, pp. 29-34
Citation: C. Choffrut et al., A NOTE ON DECIDABILITY QUESTIONS ON PRESENTATIONS OF WORD SEMIGROUPS, Theoretical computer science, 183(1), 1997, pp. 83-92
Citation: J. Karhumaki et W. Plandowski, ON THE SIZE OF INDEPENDENT SYSTEMS OF EQUATIONS IN SEMIGROUPS, Theoretical computer science, 168(1), 1996, pp. 105-119
Authors:
DERENCOURT D
KARHUMAKI J
LATTEUX M
TERLUTTE A
Citation: D. Derencourt et al., ON CONTINUOUS-FUNCTIONS COMPUTED BY FINITE AUTOMATA, Informatique theorique et applications, 28(3-4), 1994, pp. 387-403
Citation: J. Karhumaki et al., EFFICIENT CONSTRUCTIONS OF TEST SETS FOR REGULAR AND CONTEXT-FREE LANGUAGES, Theoretical computer science, 116(2), 1993, pp. 305-316