State Complexity of Combined Operations for Prefix-Free Regular Languages

Authors:
Yo-Sub Han;Kai Salomaa;Sheng Yu
Affiliations:
Intelligence and Interaction Research Center, KIST, Cheongryang, Seoul, Korea;School of Computing, Queen's University, Kingston, Canada K7L 3N6;Department of Computer Science, University of Western Ontario, London, Canada N6A 5B7
Venue:
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Year:
2009

Citing 19
Cited 2

The state complexities of some basic operations on regular languages

Theoretical Computer Science
State complexity of regular languages

Journal of Automata, Languages and Combinatorics
Theory of Computation: A Primer

Theory of Computation: A Primer
Modeling Reactive Systems with Statecharts: The Statemate Approach

Modeling Reactive Systems with Statecharts: The Statemate Approach
Theory of Codes

Theory of Codes
Tight lower bound for the state complexity of shuffle of regular languages

Journal of Automata, Languages and Combinatorics
Average State Complexity of Operations on Unary Automata

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
State Complexity of Basic Operations on Finite Languages

WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Applications of Finite-State Transducers in Natural Language Processing

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
Mastering Regular Expressions

Mastering Regular Expressions
On the state complexity of reversals of regular languages

Theoretical Computer Science
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
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
State complexity of combined operations

Theoretical Computer Science
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal

Fundamenta Informaticae
The state complexity of L2 and Lk

Information Processing Letters
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 of basic operations on suffix-free regular languages

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of 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
Prefix-Free regular languages: closure properties, difference, and left quotient

MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the state complexity of combined operations for prefix-free regular languages. Prefix-free minimal deterministic finite-state automata have a unique structural property that plays an important role to obtain the precise state complexity of basic operations. Based on the same property, we establish the precise state complexity of four combined operations: star-of-union, star-of-intersection, star-of-reversal and star-of-catenation.