AAAAAA

   
Results: 1-8 |
Results: 8
EXAMPLES OF UNDECIDABLE PROBLEMS FOR 2-GENERATOR MATRIX SEMIGROUPS
Authors: CASSAIGNE J KARHUMAKI J
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
A NOTE ON DECIDABILITY QUESTIONS ON PRESENTATIONS OF WORD SEMIGROUPS
Authors: CHOFFRUT C HARJU T KARHUMAKI J
Citation: C. Choffrut et al., A NOTE ON DECIDABILITY QUESTIONS ON PRESENTATIONS OF WORD SEMIGROUPS, Theoretical computer science, 183(1), 1997, pp. 83-92
ON THE SIZE OF INDEPENDENT SYSTEMS OF EQUATIONS IN SEMIGROUPS
Authors: KARHUMAKI J PLANDOWSKI W
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
POLYNOMIAL SIZE TEST SETS FOR CONTEXT-FREE LANGUAGES
Authors: KARHUMAKI J PLANDOWSKI W RYTTER W
Citation: J. Karhumaki et al., POLYNOMIAL SIZE TEST SETS FOR CONTEXT-FREE LANGUAGES, Journal of computer and system sciences, 50(1), 1995, pp. 11-19
CULIK,KAREL - PREFACE
Authors: CHOFFRUT C KARHUMAKI J
Citation: C. Choffrut et J. Karhumaki, CULIK,KAREL - PREFACE, Informatique theorique et applications, 28(3-4), 1994, pp. 155-157
ON CONTINUOUS-FUNCTIONS COMPUTED BY FINITE AUTOMATA
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
FINITE AUTOMATA COMPUTING REAL FUNCTIONS
Authors: CULIK K KARHUMAKI J
Citation: K. Culik et J. Karhumaki, FINITE AUTOMATA COMPUTING REAL FUNCTIONS, SIAM journal on computing, 23(4), 1994, pp. 789-814
EFFICIENT CONSTRUCTIONS OF TEST SETS FOR REGULAR AND CONTEXT-FREE LANGUAGES
Authors: KARHUMAKI J RYTTER W JAROMINEK S
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
Risultati: 1-8 |