Intersection and union of regular languages and state complexity
Information Processing Letters
Partial orders on words, minimal elements of regular languages, and state complexity
Theoretical Computer Science
The state complexities of some basic operations on regular languages
Theoretical Computer Science
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
Communication complexity and parallel computing
Communication complexity and parallel computing
Handbook of formal languages, vol. 1
State complexity of regular languages
Journal of Automata, Languages and Combinatorics
Communication complexity method for measuring nondeterminism in finite automata
Information and Computation
Introduction to the Theory of Computation
Introduction to the Theory of Computation
On the state complexity of k-entry deterministic finite automata
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Tight lower bound for the state complexity of shuffle of regular languages
Journal of Automata, Languages and Combinatorics
State Complexity of Basic Operations on Finite Languages
WIA '99 Revised Papers from the 4th 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
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
Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
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
The state complexity of L2 and Lk
Information Processing Letters
State complexity of combined operations
Theoretical Computer Science
Transition complexity of language operations
Theoretical Computer Science
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal
Fundamenta Informaticae
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
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 Nested Word Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Nondeterministic state complexity of nested word automata
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
On NFAs where all states are final, initial, or both
Theoretical Computer Science
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
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Limitations of lower bound methods for deterministic nested word automata
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
Descriptional complexity of unambiguous nested word automata
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Nondeterministic state complexity of star-free languages
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
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
Lower bounds for complementation of ω-automata via the full automata technique
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Size complexity of rotating and sweeping automata
Journal of Computer and System Sciences
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
State complexity of combined operations with two basic operations
Theoretical Computer Science
Nondeterministic state complexity of star-free languages
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
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Fundamenta Informaticae
On state complexity of finite word and tree languages
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal
Fundamenta Informaticae
State complexity of union and intersection of square and reversal on k regular languages
Theoretical Computer Science
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
Quotient complexity of ideal languages
Theoretical Computer Science
Descriptional complexity of determinization and complementation for finite automata
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Descriptional complexity of determinization and complementation for finite automata
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
State complexity of star of union and square of union on k regular languages
Theoretical Computer Science
Automata for infinite argumentation structures
Artificial Intelligence
| Hi-index | 0.01 |
We investigate the state complexity of some operations on binary regular languages. In particular, we consider the concatenation of languages represented by deterministic finite automata, and the reversal and complementation of languages represented by nondeterministic finite automata. We prove that the upper bounds on the state complexity of these operations, which were known to be tight for larger alphabets, are tight also for binary alphabets.