State complexity of combined operations

Authors:
Arto Salomaa;Kai Salomaa;Sheng Yu
Affiliations:
Turku Centre for Computer Science, Lemminkäisenkatu 14, 20520 Turku, Finland;School of Computing, Queens University, Kingston, Ontario K7L 3N6, Canada;Department of Computer Science, The University of Western Ontario, London, Ontario, N6A 5B7, Canada
Venue:
Theoretical Computer Science
Year:
2007

Citing 16
Cited 35

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
Regular languages

Handbook of formal languages, vol. 1
NFA to DFA transformation for finite languages over arbitrary alphabets

Journal of Automata, Languages and Combinatorics
State complexity of regular languages

Journal of Automata, Languages and Combinatorics
Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs

Theoretical Computer Science
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)
Theory of Automata

Theory of Automata
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
On the state complexity of reversals of regular languages

Theoretical Computer Science
State complexity of some operations on binary regular languages

Theoretical Computer Science - Descriptional complexity of formal systems
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
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 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 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
State complexity of power

Theoretical Computer Science
State complexity of unique rational operations

Theoretical Computer Science
A decision procedure for subset constraints over regular languages

Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's

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
Descriptional complexity of nondeterministic finite automata

DLT'07 Proceedings of the 11th international conference on Developments in language theory
On the State Complexity of Scattered Substrings and Superstrings

Fundamenta Informaticae
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
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
State complexity of union and intersection of star on k regular languages

Theoretical 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
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
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
The state complexity of star-complement-star

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
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
In search of most complex regular languages

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
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
On the boundary of regular languages

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

Quantified Score

Hi-index	5.24

Visualization

Abstract

We study the state complexity of combined operations. Two particular combined operations are studied: star of union and star of intersection. It is shown that the state complexity of a combined operation is not necessarily similar to the combination of the individual state complexities of the participating operations.