关注
Kai Salomaa
Kai Salomaa
Professor, School of Computing, Queen's University
在 cs.queensu.ca 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
The state complexities of some basic operations on regular languages
S Yu, Q Zhuang, K Salomaa
Theoretical Computer Science 125 (2), 315-328, 1994
4161994
A sharpening of the Parikh mapping
A Mateescu, A Salomaa, K Salomaa, S Yu
RAIRO-Theoretical Informatics and Applications 35 (6), 551-564, 2001
1582001
State complexity of basic operations on finite languages
C Câmpeanu, K Culik, K Salomaa, S Yu
Automata Implementation: 4th International Workshop on Implementing Automata …, 2001
1512001
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
1292003
Decision problems for patterns
T Jiang, A Salomaa, K Salomaa, S Yu
Journal of Computer and System Sciences 50 (1), 53-63, 1995
1051995
Deterministic tree pushdown automata and monadic tree rewriting systems
K Salomaa
Journal of Computer and System Sciences 37 (3), 367-394, 1988
991988
State complexity of combined operations
A Salomaa, K Salomaa, S Yu
Theoretical Computer Science 383 (2-3), 140-152, 2007
952007
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
912002
State complexity of basic operations on suffix-free regular languages
YS Han, K Salomaa
Theoretical Computer Science 410 (27-29), 2537-2548, 2009
752009
LANGUAGES OVER ARBITRARY ALPHABETS
K Salomaa, YU SHENG
Journal of Automata, Languages and Combinatorics 2 (3), 177-186, 1997
721997
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: Annual Print and CD-ROM …, 1996
711996
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
681994
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
662001
Operational State Complexity of Prefix-Free Regular Languages.
YS Han, K Salomaa, D Wood
Automata, Formal Languages, and Related Topics, 99-115, 2009
592009
Patterns
K Salomaa
Formal Languages and Applications, 367-379, 2004
582004
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
572008
Complexity of input-driven pushdown automata
A Okhotin, K Salomaa
ACM SIGACT News 45 (2), 47-67, 2014
542014
Inclusion is undecidable for pattern languages
T Jiang, A Salomaa, K Salomaa, S Yu
Automata, Languages and Programming: 20th International Colloquium, ICALP 93 …, 1993
541993
Finite state complexity
CS Calude, K Salomaa, TK Roblot
Theoretical Computer Science 412 (41), 5668-5677, 2011
50*2011
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
482009
系统目前无法执行此操作，请稍后再试。
文章 1–20