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
Complementing unary nondeterministic automata
Theoretical Computer Science - Descriptional complexity of formal systems
Economy of description for basic constructions on rational transductions
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
State Complexity: Recent Results and Open Problems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
State complexity of combined operations
Theoretical Computer Science
Transition complexity of language operations
Theoretical Computer Science
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
Succinctness of Regular Expressions with Interleaving, Intersection and Counting
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
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
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
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
State complexity of basic operations on suffix-free regular languages
Theoretical Computer Science
Estimation of state complexity of combined operations
Theoretical Computer Science
Operational state complexity of nested word automata
Theoretical Computer Science
Unary language operations and their nondeterministic state complexity
DLT'02 Proceedings of the 6th international conference on Developments in language theory
State complexity of basic operations on nondeterministic finite automata
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Descriptional complexity of nondeterministic finite automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
State complexity of union and intersection of finite languages
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Succinctness of regular expressions with interleaving, intersection and counting
Theoretical Computer Science
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 and computational complexity of finite automata---A survey
Information and Computation
State complexity of catenation combined with union and intersection
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Journal of Computer and System Sciences
Syntactic complexity of ideal and closed languages
DLT'11 Proceedings of the 15th international conference on Developments in language theory
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
Syntactic complexity of Prefix-, Suffix-, and Bifix-free regular languages
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
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
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 combined operations with two basic operations
Theoretical Computer Science
Foundations of regular expressions in XML schema languages and SPARQL
PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
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
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
Syntactic complexities of some classes of star-free languages
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
Quotient complexities of atoms of regular languages
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
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
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
Sheng Yu (1950-2012) In Memoriam
Fundamenta Informaticae
State complexity of basic operations on suffix-free regular languages
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
In search of most complex regular languages
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
Universal witnesses for state complexity of basic operations combined with reversal
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
State complexity of combined operations for suffix-free regular languages
Theoretical Computer Science
Quotient Complexity of Closed Languages
Theory of Computing Systems
Hi-index | 0.02 |