State Complexity of Basic Operations on Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
On the number of distinct languages accepted by finite automata with n states
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
On the state complexity of reversals of regular languages
Theoretical Computer Science
The maximum state complexity for finite languages
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Results on Transforming NFA into DFCA
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
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
On the average state and transition complexity of finite languages
Theoretical Computer Science
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal
Fundamenta Informaticae
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
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
Determination of finite automata accepting subregular languages
Theoretical Computer Science
Estimation of state complexity of combined operations
Theoretical Computer Science
Unary language operations and their nondeterministic state complexity
DLT'02 Proceedings of the 6th international conference on Developments in language theory
State complexity of basic operations on nondeterministic finite automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Nondeterministic state complexity of star-free languages
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
On the state complexity of combined operations
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Tight bounds for NFA to DFCA transformations for binary alphabets
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Nondeterministic state complexity of star-free languages
Theoretical Computer Science
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal
Fundamenta Informaticae
Results on Transforming NFA into DFCA
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Incomplete transition complexity of basic operations on finite languages
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.01 |