Kai Salomaa

Cited by

	All	Since 2017
Citations	3574	959
h-index	28	14
i10-index	86	28

300

150

225

19931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202215 19 31 37 57 38 33 40 28 64 46 99 68 69 135 106 190 236 190 283 167 188 217 200 220 171 209 160 194 4

Public access

View all

25 articles

5 articles

available

not available

Based on funding mandates

Co-authors

Yo-Sub HanDept. of Computer Science, Yonsei UniversityVerified email at yonsei.ac.kr
Selim AklProfessor, School of Computing, Queen's UniversityVerified email at cs.queensu.ca
Mike DomaratzkiWestern UniversityVerified email at uwo.ca
Alexander OkhotinUniversity of TurkuVerified email at utu.fi
Alexandros PalioudakisGoldman SachsVerified email at gs.com
Sang-Ki KoKangwon National UniversityVerified email at kangwon.ac.kr
Salimur ChoudhuryAssociate Professor, Lakehead UniversityVerified email at lakeheadu.ca
Cristian S. CaludeProfessor of Computer Science, The University of AucklandVerified email at cs.auckland.ac.nz
Timothy NgUniversity of ChicagoVerified email at uchicago.edu
David RappaportQueen's UniversityVerified email at cs.queensu.ca
Da-Jung ChoYonsei UniversityVerified email at yonsei.ac.kr
Tao JiangUC RiversideVerified email at cs.ucr.edu
Taylor J. SmithSt. Francis Xavier UniversityVerified email at stfx.ca
Elena CzeizlerResearch Scientist, Varian Medical Systems FiVerified email at varian.com
Eugen CzeizlerResearcher, Åbo Akademi UniversityVerified email at abo.fi
Hwee KimYonsei UniversityVerified email at yonsei.ac.kr
Grzegorz RozenbergProfessor of Computer Science, Leiden UniversityVerified email at liacs.leidenuniv.nl
Sándor VágvölgyiSzegedi EgyetemVerified email at inf.u-szeged.hu
Markus HolzerProfessor für Informatik, Universität GiessenVerified email at in.tum.de
Nafiul RashidPhD Candidate at Dept. of EECS, University of California, IrvineVerified email at uci.edu

Kai Salomaa

Professor, School of Computing, Queen's University

Verified email at cs.queensu.ca - Homepage

Theory of computation automata theory formal languages descriptional complexity


Title Sort by citations Sort by year Sort by 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	382	1994
State complexity of basic operations on finite languages C Câmpeanu, K Culik, K Salomaa, S Yu International Workshop on Implementing Automata, 60-70, 1999	145	1999
A sharpening of the Parikh mapping A Mateescu, A Salomaa, K Salomaa, S Yu RAIRO-Theoretical Informatics and Applications 35 (6), 551-564, 2001	139	2001
Decision problems for patterns T Jiang, A Salomaa, K Salomaa, S Yu Journal of Computer and System Sciences 50 (1), 53-63, 1995	100	1995
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	96	2003
Deterministic tree pushdown automata and monadic tree rewriting systems K Salomaa Journal of Computer and System Sciences 37 (3), 367-394, 1988	94	1988
State complexity of combined operations A Salomaa, K Salomaa, S Yu Theoretical Computer Science 383 (2-3), 140-152, 2007	88	2007
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	81	2002
State complexity of basic operations on suffix-free regular languages YS Han, K Salomaa Theoretical Computer Science 410 (27-29), 2537-2548, 2009	70	2009
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	64	1994
LANGUAGES OVER ARBITRARY ALPHABETS K Salomaa, YU SHENG Journal of Automata, Languages and Combinatorics 2 (3), 177-186, 1997	63	1997
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	63	1996
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	58	2001
Patterns K Salomaa Formal Languages and Applications, 367-379, 2004	57	2004
Operational State Complexity of Prefix-Free Regular Languages. YS Han, K Salomaa, D Wood Automata, Formal Languages, and Related Topics, 99-115, 2009	55	2009
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	52	2008
Inclusion is undecidable for pattern languages T Jiang, A Salomaa, K Salomaa, S Yu International Colloquium on Automata, Languages, and Programming, 301-312, 1993	49	1993
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	46	2009
Finite state complexity CS Calude, K Salomaa, TK Roblot Theoretical Computer Science 412 (41), 5668-5677, 2011	44*	2011
Analysis of a cellular automaton model for car traffic with a slow-to-stop rule A Clarridge, K Salomaa Theoretical Computer Science 411 (38-39), 3507-3515, 2010	42*	2010

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow this author

Cited by

Co-authors