AAAAAA

   
Results: 1-15 |
Results: 15
SYNCHRONIZATION EXPRESSIONS WITH EXTENDED JOIN OPERATION
Authors: SALOMAA K YU S
Citation: K. Salomaa et S. Yu, SYNCHRONIZATION EXPRESSIONS WITH EXTENDED JOIN OPERATION, Theoretical computer science, 207(1), 1998, pp. 73-88
DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC SYNCHRONIZED TREE AUTOMATA
Authors: SALOMAA K
Citation: K. Salomaa, DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC SYNCHRONIZED TREE AUTOMATA, Theoretical computer science, 167(1-2), 1996, pp. 171-192
STRUCTURAL EQUIVALENCE AND ETOL GRAMMARS
Authors: SALOMAA K WOOD D YU S
Citation: K. Salomaa et al., STRUCTURAL EQUIVALENCE AND ETOL GRAMMARS, Theoretical computer science, 164(1-2), 1996, pp. 123-140
YIELD-LANGUAGES OF 2-WAY PUSHDOWN TREE AUTOMATA
Authors: SALOMAA K
Citation: K. Salomaa, YIELD-LANGUAGES OF 2-WAY PUSHDOWN TREE AUTOMATA, Information processing letters, 58(4), 1996, pp. 195-199
COMPLEXITY OF EOL STRUCTURAL EQUIVALENCE
Authors: SALOMAA K WOOD D YU S
Citation: K. Salomaa et al., COMPLEXITY OF EOL STRUCTURAL EQUIVALENCE, Informatique theorique et applications, 29(6), 1995, pp. 471-485
P, NP, AND THE POST CORRESPONDENCE PROBLEM
Authors: MATEESCU A SALOMAA A SALOMAA K YU S
Citation: A. Mateescu et al., P, NP, AND THE POST CORRESPONDENCE PROBLEM, Information and computation, 121(2), 1995, pp. 135-142
DECISION-PROBLEMS FOR PATTERNS
Authors: JIANG T SALOMAA A SALOMAA K YU S
Citation: T. Jiang et al., DECISION-PROBLEMS FOR PATTERNS, Journal of computer and system sciences, 50(1), 1995, pp. 53-63
PUMPING AND PUSHDOWN MACHINES
Authors: SALOMAA K WOOD D YU S
Citation: K. Salomaa et al., PUMPING AND PUSHDOWN MACHINES, Informatique theorique et applications, 28(3-4), 1994, pp. 221-232
TRANSDUCERS AND THE DECIDABILITY OF INDEPENDENCE IN FREE MONOIDS
Authors: JURGENSEN H SALOMAA K YU S
Citation: H. Jurgensen et al., TRANSDUCERS AND THE DECIDABILITY OF INDEPENDENCE IN FREE MONOIDS, Theoretical computer science, 134(1), 1994, pp. 107-117
TRANSDUCERS AND THE DECIDABILITY OF INDEPENDENCE IN FREE MONOIDS
Authors: JURGENSEN H SALOMAA K YU S
Citation: H. Jurgensen et al., TRANSDUCERS AND THE DECIDABILITY OF INDEPENDENCE IN FREE MONOIDS, Theoretical computer science, 134(1), 1994, pp. 107-117
SYNCHRONIZED TREE AUTOMATA
Authors: SALOMAA K
Citation: K. Salomaa, SYNCHRONIZED TREE AUTOMATA, Theoretical computer science, 127(1), 1994, pp. 25-51
THE STATE COMPLEXITIES OF SOME BASIC OPERATIONS ON REGULAR LANGUAGES
Authors: YU S ZHUANG QY SALOMAA K
Citation: S. Yu et al., THE STATE COMPLEXITIES OF SOME BASIC OPERATIONS ON REGULAR LANGUAGES, Theoretical computer science, 125(2), 1994, pp. 315-328
SEMANTICS OF TREES
Authors: EHRENFEUCHT A ROZENBERG G SALOMAA K
Citation: A. Ehrenfeucht et al., SEMANTICS OF TREES, Mathematical systems theory, 27(2), 1994, pp. 159-181
MEASURES OF NONDETERMINISM FOR PUSHDOWN-AUTOMATA
Authors: SALOMAA K YU S
Citation: K. Salomaa et S. Yu, MEASURES OF NONDETERMINISM FOR PUSHDOWN-AUTOMATA, Journal of computer and system sciences, 49(2), 1994, pp. 362-374
PATTERN LANGUAGES WITH AND WITHOUT ERASING
Authors: JIANG T KINBER E SALOMAA A SALOMAA K YU S
Citation: T. Jiang et al., PATTERN LANGUAGES WITH AND WITHOUT ERASING, International journal of computer mathematics, 50(3-4), 1994, pp. 147-163
Risultati: 1-15 |