Sotabase
Home
Researchers
Career
·
Professor / Graduate Chair
,
Queen's University
2000–
·
PhD in Computer Science
,
University of Turku
1989–
·
Professor
,
McMaster University
·
Professor
,
University of Western Ontario
Publications
(532)
The State Complexities of Some Basic Operations on Regular Languages
Theoretical Computer Science · 1994
351
cited
A sharpening of the Parikh mapping
RAIRO - Theoretical Informatics and Applications · 2001
149
cited
State Complexity of Basic Operations on Finite Languages
WIA · 1999
118
cited
A Formal Study Of Practical Regular Expressions
International Journal of Foundations of Computer Science · 2003
98
cited
State complexity of combined operations
Theoretical Computer Science · 2007
89
cited
Decision Problems for Patterns
Journal of computer and system sciences (Print) · 1995
88
cited
Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems
Journal of computer and system sciences (Print) · 1988
87
cited
Tight Lower Bound for the State Complexity of Shuffle of Regular Languages
J. Autom. Lang. Comb. · 2002
72
cited
State complexity of basic operations on suffix-free regular languages
Theoretical Computer Science · 2007
67
cited
Pattern languages with and without erasing
1994
66
cited
NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets
J. Autom. Lang. Comb. · 1998
58
cited
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal
Fundamenta Informaticae · 2008
51
cited
Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model
Journal of universal computer science (Online) · 1995
50
cited
Operational State Complexity of Prefix-Free Regular Languages
Automata, Formal Languages, and Related Topics · 2009
46
cited
On the State Complexity of k-Entry Deterministic Finite Automata
J. Autom. Lang. Comb. · 2001
45
cited
Complexity of input-driven pushdown automata
SIGA · 2014
42
cited
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae · 2009
40
cited
Inclusion is Undecidable for Pattern Languages
International Colloquium on Automata, Languages and Programming · 1993
37
cited
State Complexity of Union and Intersection of Finite Languages
International Journal of Foundations of Computer Science · 2007
36
cited
On an Extension of the Parikh Mapping
2000
35
cited
Show all 532 papers →
Sotabase