Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages

Authors:
Yo-Sub Han;Kai Salomaa;Derick Wood
Affiliations:
(Correspd.) Intelligence and Interaction Research Center, Korea Institute of Science and Technology, P.O.BOX 131, Cheongryang, Seoul, Korea. emmous@kist.re.kr;School of Computing, Queen's University, Kingston, Ontario K7L 3N6, Canada. ksalomaa@cs.queensu.ca;Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong SAR. dwood@cs.ust.hk
Venue:
Fundamenta Informaticae
Year:
2009

Citing 21
Cited 8

Minimal NFA problems are hard

SIAM Journal on Computing
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
Codes

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

Journal of Automata, Languages and Combinatorics
Deterministic generalized automata

Theoretical Computer Science
State complexity of regular languages

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

Theory of Computation: A Primer
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Theory of Codes

Theory of Codes
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
State complexity of combined operations

Theoretical Computer Science
Prefix-free regular languages and pattern matching

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

Fundamenta Informaticae
Economy of description by automata, grammars, and formal systems

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
On the state complexity of combined operations

CIAA'06 Proceedings of the 11th 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
Networks of evolutionary processors with subregular filters

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
Complexity of operations on cofinite languages

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Some minimality results on biresidual and biseparable automata

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
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
On external contextual grammars with subregular selection languages

Theoretical Computer Science
Nondeterministic state complexity of star-free languages

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the nondeterministic state complexity of basic operations for prefix-free regular languages. The nondeterministic state complexity of an operation is the number of states that are necessary and sufficient in the worst-case for a minimal nondeterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, union, intersection, Kleene star, reversal and complementation for prefix-free regular languages.