Simulating finite automata with context-free grammars
Information Processing Letters
Theoretical Computer Science - Mathematical foundations of computer science
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
The state complexity of L2 and Lk
Information Processing Letters
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
A Formal Language Analysis of DNA Hairpin Structures
Fundamenta Informaticae
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 State Complexity of Complements, Stars, and Reversals of Regular Languages
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
State Complexity of Nested Word Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Theoretical Computer Science
State complexity of unique rational operations
Theoretical Computer Science
Nondeterministic state complexity of nested word automata
Theoretical Computer Science
Theoretical Computer Science
Language operations with regular expressions of polynomial size
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
The state complexity of L2 and Lk
Information Processing Letters
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
Assisted problem solving and decompositions of finite automata
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
On the State Complexity of Scattered Substrings and Superstrings
Fundamenta Informaticae
Complexity in union-free regular languages
DLT'10 Proceedings of the 14th international conference on Developments in language theory
State complexity of prefix, suffix, bifix and infix operators on 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
Limitations of lower bound methods for deterministic nested word automata
Information and Computation
Descriptional and computational complexity of finite automata---A survey
Information and Computation
Comparing necessary conditions for recognizability of two-dimensional languages
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Descriptional complexity of unambiguous nested word automata
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Chop operations and expressions: descriptional complexity considerations
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Nondeterministic state complexity of star-free languages
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
On restarting automata with window size one
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Hairpin structures in DNA words
DNA'05 Proceedings of the 11th international conference on DNA Computing
On hairpin-free words and languages
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
State complexity of concatenation and complementation of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
On CD-systems of stateless deterministic R-automata with window size one
Journal of Computer and System Sciences
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
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
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
From equivalence to almost-equivalence, and beyond--minimizing automata with errors
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
A Formal Language Analysis of DNA Hairpin Structures
Fundamenta Informaticae
Lower bounds for the size of deterministic unranked tree automata
Theoretical Computer Science
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Descriptional complexity of determinization and complementation for finite automata
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Automata for infinite argumentation structures
Artificial Intelligence
Hi-index | 0.90 |