Theoretical Computer Science - Mathematical foundations of computer science
On the descriptional complexity of finite automata with modified acceptance conditions
Theoretical Computer Science - Descriptional complexity of formal systems
State complexity of some operations on binary regular languages
Theoretical Computer Science - Descriptional complexity of formal systems
Complementing unary nondeterministic automata
Theoretical Computer Science - Descriptional complexity of formal systems
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
State complexity of combined operations
Theoretical Computer Science
Succinct description of regular languages by weak restarting automata
Information and Computation
Nondeterministic Finite Automata--Recent Results on the Descriptional and Computational Complexity
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On the State Complexity of Complements, Stars, and Reversals of Regular Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
On the State Complexity of Operations on Two-Way Finite Automata
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Decimations of languages and state complexity
Theoretical Computer Science
Theoretical Computer Science
Concatenation of Regular Languages and Descriptional Complexity
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
On NFAs where all states are final, initial, or both
Theoretical Computer Science
The Büchi complementation saga
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Descriptional complexity of nondeterministic finite automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Deterministic blow-ups of minimal nondeterministic finite automata over a fixed alphabet
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Complexity in union-free regular languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
State complexity of operations on input-driven pushdown automata
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Lower bounds for complementation of ω-automata via the full automata technique
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
On the state complexity of combined operations
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Unambiguous finite automata over a unary alphabet
Information and Computation
State complexity of concatenation and complementation of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
| Hi-index | 5.23 |