Finite automata and unary languages
Theoretical Computer Science
Complementing unary nondeterministic automata
Theoretical Computer Science - Descriptional complexity of formal systems
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics
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
Finite Automata, Palindromes, Powers, and Patterns
Language and Automata Theory and Applications
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Determination of finite automata accepting subregular languages
Theoretical Computer Science
Lower bounds on the size of sweeping automata
Journal of Automata, Languages and Combinatorics
A Similarity Measure for Cyclic Unary Regular Languages
Fundamenta Informaticae
On the size of the universal automaton of a regular language
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Unambiguous finite automata over a unary alphabet
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Describing periodicity in two-way deterministic finite automata using transformation semigroups
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Chrobak normal form revisited, with applications
CIAA'11 Proceedings of the 16th 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
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
State complexity of projected languages
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
State complexity of operations on two-way deterministic finite automata over a unary alphabet
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Ambiguity of unary symmetric difference NFAs
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Magic numbers in the state hierarchy of finite automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Basic operations on binary suffix-free languages
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Two-Way automata making choices only at the endmarkers
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Nondeterministic state complexity of star-free languages
Theoretical Computer Science
State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
On the Size of Unary Probabilistic and Nondeterministic Automata
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Removing nondeterminism in constant height pushdown automata
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Descriptional complexity of biautomata
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
| Hi-index | 5.23 |