Kai Salomaa
Kai Salomaa
Professor, School of Computing, Queen's University
Verified email at cs.queensu.ca - Homepage
Title
Cited by
Cited by
Year
The state complexities of some basic operations on regular languages
S Yu, Q Zhuang, K Salomaa
Theoretical Computer Science 125 (2), 315-328, 1994
3581994
State complexity of basic operations on finite languages
C Campeanu, K Culik, K Salomaa, S Yu
International Workshop on Implementing Automata, 60-70, 1999
1381999
A sharpening of the Parikh mapping
A Mateescu, A Salomaa, K Salomaa, S Yu
RAIRO-Theoretical Informatics and Applications 35 (6), 551-564, 2001
1242001
Decision problems for patterns
T Jiang, A Salomaa, K Salomaa, S Yu
J. Comput. Syst. Sci. 50 (1), 53-63, 1995
971995
Deterministic tree pushdown automata and monadic tree rewriting systems
K Salomaa
Journal of Computer and System Sciences 37 (3), 367-394, 1988
931988
A formal study of practical regular expressions
C Câmpeanu, K Salomaa, S Yu
International Journal of Foundations of Computer Science 14 (06), 1007-1018, 2003
902003
State complexity of combined operations
A Salomaa, K Salomaa, S Yu
Theoretical Computer Science 383 (2-3), 140-152, 2007
862007
Tight lower bound for the state complexity of shuffle of regular languages
C Câmpeanu, K Salomaa, S Yu
Journal of Automata, Languages and Combinatorics 7 (3), 303-310, 2002
772002
State complexity of basic operations on suffix-free regular languages
YS Han, K Salomaa
Theoretical Computer Science 410 (27-29), 2537-2548, 2009
692009
Pattern languages with and without erasing
T Jiang, E Kinber, A Salomaa, K Salomaa, S Yu
International Journal of Computer Mathematics 50 (3-4), 147-163, 1994
641994
Lexical analysis with a simple finite-fuzzy-automaton model
A Mateescu, A Salomaa, K Salomaa, S Yu
J. UCS The Journal of Universal Computer Science, 292-311, 1996
621996
LANGUAGES OVER ARBITRARY ALPHABETS
K Salomaa, YU SHENG
Journal of Automata, Languages and Combinatorics 2 (3), 177-186, 1997
601997
Patterns
K Salomaa
Formal Languages and Applications, 367-379, 2004
562004
On the state complexity of k-entry deterministic finite automata
M Holzer, K Salomaa, S Yu
Journal of Automata, Languages and Combinatorics 6 (4), 453-466, 2001
562001
Operational State Complexity of Prefix-Free Regular Languages.
YS Han, K Salomaa, D Wood
Automata, Formal Languages, and Related Topics, 99-115, 2009
542009
Inclusion is undecidable for pattern languages
T Jiang, A Salomaa, K Salomaa, S Yu
International Colloquium on Automata, Languages, and Programming, 301-312, 1993
491993
The state complexity of two combined operations: star of catenation and star of Reversal
Y Gao, K Salomaa, S Yu
Fundamenta Informaticae 83 (1-2), 75-89, 2008
482008
Nondeterministic state complexity of basic operations for prefix-free regular languages
YS Han, K Salomaa, D Wood
Fundamenta Informaticae 90 (1-2), 93-106, 2009
452009
Metric lexical analysis
CS Calude, K Salomaa, S Yu
International Workshop on Implementing Automata, 48-59, 1999
421999
Finite state complexity
CS Calude, K Salomaa, TK Roblot
Theoretical Computer Science 412 (41), 5668-5677, 2011
40*2011
The system can't perform the operation now. Try again later.
Articles 1–20