State complexity of union and intersection of finite languages

Authors:
Yo-Sub Han;Kai Salomaa
Affiliations:
Intelligence and Interaction Research Center, Korea Institute of Science and Technology, Cheongryang, Seoul, Korea;School of Computing, Queen's University, Kingston, Ontario, Canada
Venue:
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Year:
2007

Citing 8
Cited 2

The state complexities of some basic operations on regular languages

Theoretical Computer Science
Grail: a C++ library for automata and expressions

Journal of Symbolic Computation - Special issue on “algorithms: implementation, libraries and use”
State complexity 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
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
Unary language operations and their nondeterministic state complexity

DLT'02 Proceedings of the 6th 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
Inside vaucanson

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

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

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. We compute the upper bounds based on the structural properties of minimal deterministic finite-state automata (DFAs) for finite languages. Then, we show that the upper bounds are tight if we have a variable sized alphabet that can depend on the size of input DFAs. In addition, we prove that the upper bounds are unreachable for any fixed sized alphabet.