Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures
Theoretical Computer Science
Nondeterminism and succinctly representable regular languages
SAICSIT '02 Proceedings of the 2002 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
Simulating finite automata with context-free grammars
Information Processing Letters
Unary Pushdown Automata and Auxiliary Space Lower Bounds
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Converting Two-Way Nondeterministic Unary Automata into Simpler Automata
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Note on Minimal Finite Automata
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Unary Language Concatenation and Its State Complexity
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
The MERLin Environment Applied to *-NFAs
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Converting two-way nondeterministic unary automata into simpler automata
Theoretical Computer Science - Mathematical foundations of computer science
The monadic quantifier alternation hierarchy over grids and graphs
Information and Computation - Special issue: LICS'97
State complexity of proportional removals
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Errata to: "finite automata and unary languages"
Theoretical Computer Science
A new algorithm for regularizing one-letter context-free grammars
Theoretical Computer Science
On binary ⊕-NFAs and succinct descriptions of regular languages
Theoretical Computer Science - Implementation and application of automata
On the descriptional power of heads, counters, and pebbles
Theoretical Computer Science - Descriptional complexity of formal systems
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
The state complexity of L2 and Lk
Information Processing Letters
Residual Finite State Automata
Fundamenta Informaticae
On the existence of prime decompositions
Theoretical Computer Science
Magic numbers in the state hierarchy of finite automata
Information and Computation
Cellular Devices and Unary Languages
Fundamenta Informaticae - Special issue on DLT'04
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
Journal of Automata, Languages and Combinatorics
Deterministic moles cannot solve liveness
Journal of Automata, Languages and Combinatorics
State fusion of fuzzy automata with application on target tracking
Computers & Mathematics with Applications
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Theoretical Computer Science
Determination of finite automata accepting subregular languages
Theoretical Computer Science
Unary finite automata vs. arithmetic progressions
Information Processing Letters
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Detecting palindromes, patterns and borders in regular languages
Information and Computation
Lower bounds on the size of sweeping automata
Journal of Automata, Languages and Combinatorics
The state complexity of L2 and Lk
Information Processing Letters
Unary language operations and their nondeterministic state complexity
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Succinct descriptions of regular languages with binary ⊕-NFAs
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
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
Expressive languages for path queries over graph-structured data
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Efficient construction of semilinear representations of languages accepted by unary NFA
RP'10 Proceedings of the 4th international conference on Reachability problems
Complexity of multi-head finite automata: Origins and directions
Theoretical Computer Science
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Optimal simulation of self-verifying automata by deterministic automata
Information and Computation
Two-way unary automata versus logarithmic space
Information and Computation
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
Geometrical regular languages and linear diophantine equations
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
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
Prime decompositions of regular languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Oblivious two-way finite automata: decidability and complexity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
An alternating hierarchy for finite automata
Theoretical Computer Science
Geometrical regular languages and linear Diophantine equations: The strongly connected case
Theoretical Computer Science
On a structural property in the state complexity of projected regular languages
Theoretical Computer Science
State complexity of operations on two-way finite automata over a unary alphabet
Theoretical Computer Science
Descriptional complexity of two-way pushdown automata with restricted head reversals
Theoretical Computer Science
Nondeterministic state complexity of star-free languages
Theoretical Computer Science
Transition Complexity of Incomplete DFAs
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
State complexity and limited nondeterminism
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
Cellular Devices and Unary Languages
Fundamenta Informaticae - Special issue on DLT'04
Residual Finite State Automata
Fundamenta Informaticae
Expressive Languages for Path Queries over Graph-Structured Data
ACM Transactions on Database Systems (TODS)
Conjunctive grammars over a unary alphabet: undecidability and unbounded growth
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
One alternation can be more powerful than randomization in small and fast two-way finite automata
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
| Hi-index | 5.24 |