Kai Salomaa

Cited by

	All	Since 2015
Citations	3346	1162
h-index	28	16
i10-index	84	37

300

150

225

199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202015 20 29 36 53 37 32 35 30 64 51 98 69 69 135 106 191 238 177 284 167 193 213 199 217 177 213 141

Co-authors

Yo-Sub HanDept. of Computer Science, Yonsei UniversityVerified email at yonsei.ac.kr
Mike DomaratzkiComputer Science, University of ManitobaVerified email at cs.umanitoba.ca
Selim AklProfessor, School of Computing, Queen's UniversityVerified email at cs.queensu.ca
Alexandros PalioudakisGoldman SachsVerified email at gs.com
Alexander OkhotinUniversity of TurkuVerified email at utu.fi
Sang-Ki KoKangwon National UniversityVerified email at kangwon.ac.kr
Salimur ChoudhuryAssistant 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
Elena CzeizlerResearch Scientist, Varian Medical Systems FiVerified email at varian.com
Eugen CzeizlerResearcher, Åbo Akademi UniversityVerified email at abo.fi
Grzegorz RozenbergProfessor of Computer Science, Leiden UniversityVerified email at liacs.leidenuniv.nl
Sándor VágvölgyiSzegedi EgyetemVerified email at inf.u-szeged.hu
Taylor J. SmithQueen's UniversityVerified email at cs.queensu.ca
Markus HolzerProfessor für Informatik, Universität GiessenVerified email at in.tum.de
Nafiul RashidPhD Candidate, University of California, IrvineVerified email at uci.edu
Hwee KimYonsei UniversityVerified email at yonsei.ac.kr

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	358	1994
State complexity of basic operations on finite languages C Campeanu, K Culik, K Salomaa, S Yu International Workshop on Implementing Automata, 60-70, 1999	138	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	124	2001
Decision problems for patterns T Jiang, A Salomaa, K Salomaa, S Yu J. Comput. Syst. Sci. 50 (1), 53-63, 1995	97	1995
Deterministic tree pushdown automata and monadic tree rewriting systems K Salomaa Journal of Computer and System Sciences 37 (3), 367-394, 1988	93	1988
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	90	2003
State complexity of combined operations A Salomaa, K Salomaa, S Yu Theoretical Computer Science 383 (2-3), 140-152, 2007	86	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	77	2002
State complexity of basic operations on suffix-free regular languages YS Han, K Salomaa Theoretical Computer Science 410 (27-29), 2537-2548, 2009	69	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
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	62	1996
LANGUAGES OVER ARBITRARY ALPHABETS K Salomaa, YU SHENG Journal of Automata, Languages and Combinatorics 2 (3), 177-186, 1997	60	1997
Patterns K Salomaa Formal Languages and Applications, 367-379, 2004	56	2004
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	56	2001
Operational State Complexity of Prefix-Free Regular Languages. YS Han, K Salomaa, D Wood Automata, Formal Languages, and Related Topics, 99-115, 2009	54	2009
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
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	48	2008
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	45	2009
Metric lexical analysis CS Calude, K Salomaa, S Yu International Workshop on Implementing Automata, 48-59, 1999	42	1999
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

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors