State complexity of concatenation and complementation of regular languages

Authors:
Jozef Jirásek;Galina Jirásková;Alexander Szabari
Affiliations:
Institute of Computer Science, P.J. Šafárik University, Košice, Slovakia;Mathematical Institute, Slovak Academy of Sciences, Košice, Slovakia;Institute of Computer Science, P.J. Šafárik University, Košice, Slovakia
Venue:
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Year:
2004

Citing 21
Cited 12

Finite automata and unary languages

Theoretical Computer Science
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
Regular languages

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
Unary Language Concatenation and Its State Complexity

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
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
On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata

IEEE Transactions on Computers
Finite automata and their decision problems

IBM Journal of Research and Development
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
Nonterminal Complexity of Some Operations on Context-Free 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
State complexity of basic operations on suffix-free regular languages

Theoretical Computer Science
The state complexity of L2 and Lk

Information Processing Letters
State complexity of union and intersection of finite languages

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Production complexity of some operations on context-free languages

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Nonterminal Complexity of Some Operations on Context-Free Languages

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 basic operations on suffix-free regular languages

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the state complexity of concatenation and the nondeterministic state complexity of complementation of regular languages. We show that the upper bounds on the state complexity of concatenation are also tight in the case that the first automaton has more than one accepting state. In the case of nondeterministic state complexity of complementation, we show that the entire range of complexities, up to the known upper bound can be produced.