Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Descriptional complexity of finite automata: concepts and open problems
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
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
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
Transition complexity of language operations
Theoretical Computer Science
On the average state and transition complexity of finite languages
Theoretical Computer Science
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics
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
Finite Automata, Palindromes, Powers, and Patterns
Language and Automata Theory and Applications
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
Lower bounds for the transition complexity of NFAs
Journal of Computer and System Sciences
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
State Complexity of Nested Word Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
More on the Size of Higman-Haines Sets: Effective Constructions
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Nondeterministic state complexity of nested word automata
Theoretical Computer Science
Theoretical Computer Science
Operational state complexity of nested word automata
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
Detecting palindromes, patterns and borders in regular languages
Information and Computation
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
More on the size of higman-haines sets: effective constructions
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Succinctness of pattern-based schema languages for XML
DBPL'07 Proceedings of the 11th international conference on Database programming languages
ACM Transactions on Database Systems (TODS)
Complexity in union-free regular languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Succinctness of pattern-based schema languages for XML
Journal of Computer and System Sciences
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Comparing necessary conditions for recognizability of two-dimensional languages
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Nondeterministic state complexity of star-free languages
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Lower bounds for the transition complexity of NFAs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
State complexity of concatenation and complementation of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Some minimality results on biresidual and biseparable automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Finding lower bounds for nondeterministic state complexity is hard
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Regular expressions for data words
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Oblivious two-way finite automata: decidability and complexity
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Nondeterministic state complexity of star-free languages
Theoretical Computer Science
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
More on the Size of Higman-Haines Sets: Effective Constructions
Fundamenta Informaticae - Machines, Computations and Universality, Part I
On inverse operations and their descriptional complexity
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
State complexity of chop operations on unary and finite languages
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
State complexity and limited nondeterminism
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Lower bounds for the size of deterministic unranked tree automata
Theoretical Computer Science
Parameterized regular expressions and their languages
Theoretical Computer Science
Silent transitions in automata with storage
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Querying Regular Graph Patterns
Journal of the ACM (JACM)
Hi-index | 0.90 |