Minimal cover-automata for finite languages
Theoretical Computer Science
Simulating finite automata with context-free grammars
Information Processing Letters
Average State Complexity of Operations on Unary Automata
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
State Complexity of Basic Operations on Finite Languages
WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
State Complexity and Jacobsthal's Function
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Unary Language Concatenation and Its State Complexity
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Shuffle Quotient and Decompositions
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
State and Transition Complexity of Watson-Crick Finite Automata
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Minimal Cover-Automata for Finite Languages
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
State complexity of proportional removals
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
Acyclic networks maximizing the printing complexity
Theoretical Computer Science - Implementation and application of automata
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
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
State complexity of shuffle on trajectories
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on 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
Generating all permutations by context-free grammars in Chomsky normal form
Theoretical Computer Science - Algebraic methods in language processing
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
Synchronized Shuffle on Backbones
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Enumeration and random generation of accessible automata
Theoretical Computer Science
State complexity of combined operations
Theoretical Computer Science
On the average state and transition complexity of finite languages
Theoretical Computer Science
Privacy preserving error resilient dna searching through oblivious automata
Proceedings of the 14th ACM conference on Computer and communications security
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics
Nonterminal Complexity of Some Operations on Context-Free Languages
Fundamenta Informaticae
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal
Fundamenta Informaticae
State complexity of basic language operations combined with reversal
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
The Frobenius Problem and Its Generalizations
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
The Average State Complexity of the Star of a Finite Set of Words Is Linear
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
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
State Complexity of Combined Operations for Prefix-Free Regular Languages
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
State complexity of basic operations on suffix-free regular languages
Theoretical Computer Science
State-complexity hierarchies of uniform languages of alphabet-size length
Theoretical Computer Science
Estimation of state complexity of combined operations
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
The state complexity of L2 and Lk
Information Processing Letters
State complexity of basic operations on nondeterministic finite automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Running time complexity of printing an acyclic automaton
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
State complexity of union and intersection of finite languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
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
Unambiguous finite automata over a unary alphabet
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
State complexity of catenation combined with union and intersection
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Undecidability of the state complexity of composed regular operations
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
State complexity research and approximation
DLT'11 Proceedings of the 15th international conference on Developments in language theory
The size-cost of Boolean operations on constant height deterministic pushdown automata
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
State complexity of four combined operations composed of union, intersection, star and reversal
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Note on reversal of binary regular 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
On the state complexity of combined operations
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Quotient complexity of ideal languages
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Complexity of operations on cofinite languages
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
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
State complexity and the monoid of transformations of a finite set
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Quotient complexity of closed languages
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Complexity in convex languages
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
State complexity of union and intersection of star on k regular languages
Theoretical Computer Science
State complexity of the concatenation of regular tree languages
Theoretical Computer Science
Prefix-Free regular languages: closure properties, difference, and left quotient
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
State complexity of kleene-star operations on trees
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
State complexity of combined operations with two basic operations
Theoretical Computer Science
The size-cost of Boolean operations on constant height deterministic pushdown automata
Theoretical Computer Science
Reversal of binary regular languages
Theoretical Computer Science
State complexity of operations on two-way finite automata over a unary alphabet
Theoretical Computer Science
A finite state intersection approach to propositional satisfiability
Theoretical Computer Science
On the State Complexity of Star of Union and Star of Intersection
Fundamenta Informaticae
Transition Complexity of Incomplete DFAs
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
On inverse operations and their descriptional complexity
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Production complexity of some operations on context-free languages
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
State complexity of star and square of union of k regular languages
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
Descriptional complexity of biautomata
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
State complexity of projection and quotient on unranked trees
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
The state complexity of star-complement-star
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
On state complexity of finite word and tree languages
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Nonterminal Complexity of Some Operations on Context-Free Languages
Fundamenta Informaticae
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal
Fundamenta Informaticae
Descriptional complexity of deterministic regular expressions
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Synchronized Shuffle on Backbones
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
State complexity of union and intersection of square and reversal on k regular languages
Theoretical Computer Science
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Fundamenta Informaticae
State Complexity of Combined Operations with Union, Intersection, Star and Reversal
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Mirror Images and Schemes for the Maximal Complexity of Nondeterminism
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
State complexity of basic operations on suffix-free regular languages
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
In search of most complex regular languages
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
On the state and computational complexity of the reverse of acyclic minimal DFAs
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Quotient complexity of ideal languages
Theoretical Computer Science
State complexity of star of union and square of union on k regular languages
Theoretical Computer Science
On the boundary of regular languages
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Automata for infinite argumentation structures
Artificial Intelligence
State complexity of combined operations for suffix-free regular languages
Theoretical Computer Science
Quotient Complexity of Closed Languages
Theory of Computing Systems
| Hi-index | 5.25 |