State complexity of basic operations on suffix-free regular languages

@article{Han2007StateCO,
  title={State complexity of basic operations on suffix-free regular languages},
  author={Yo-Sub Han and Kai Salomaa},
  journal={Theor. Comput. Sci.},
  year={2007},
  volume={410},
  pages={2537-2548}
}
View via Publisher
cs.yonsei.ac.kr
65 Citations
Highly Influential Citations
12
Background Citations
46
Methods Citations
5
Results Citations
1

65 Citations

State complexity of combined operations for suffix-free regular languages

State Complexity of Combined Operations for Prefix-Free Regular Languages

This work establishes the precise state complexity of four combined operations of prefix-free minimal deterministic finite-state automata: star-of-union, star- of-intersection, star of-reversal and star-Of-catenation.

State Complexity of Basic Operations on Non-Returning Regular Languages

This work establishes the precise state complexity of four Boolean operations (union, intersection, difference, symmetric difference, catenation, reversal, and Kleene-star) for non-returning regular languages.

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

This work establishes the precise state complexity of catenation, union, intersection, Kleene star, reversal and complementation for prefix-free regular languages.

Nondeterministic State Complexity for Suffix-Free Regular Languages

This work considers basic operations of suffix-free regular languages (catenation, union, intersection, Kleene star, reversal and complementation) and establishes matching upper and lower bounds for each operation.

Basic Operations on Binary Suffix-Free Languages

It is proved that the bound for reversal cannot be met by binary languages, and the upper bounds on the state complexity of all the boolean operations as well as of Kleene star are tight in the binary case.

Complexity in Prefix-Free Regular Languages

We examine deterministic and nondeterministic state complexities of regular operations on prefix-free languages. We strengthen several results by providing witness languages over smaller alphabets,…

Operational State Complexity of Subtree-Free Regular Tree Languages

The precise state complexity of (sequential, parallel) concatenation, (bottom-up, top-down) star, intersection and union for subtree-free regular tree languages is established.

State Complexity of Combined Operations for Suffix-free Regular Languages

This thesis focuses on estimating the state complexities of combined operations of prefix free regular languages for individual and combined operations for suffixfree regular languages.

Complexity in Union-Free Regular Languages

It is proved that (deterministic) union-freeness of languages does not accelerate regular operations, except for the reversal in the nondeterministic case.
...

33 References

State Complexity of Prefix-Free Regular Languages

It is demonstrated that the state complexities of intersection and union operations based on the structural properties of prefix-free minimal DFAs can be reduced.

The State Complexities of Some Basic Operations on Regular Languages

State Complexity of Concatenation and Complementation of Regular Languages

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, and the entire range of complexities, up to the known upper bound can be produced.

On the state complexity of reversals of regular languages

Unary Language Operations and Their Nondeterministic State Complexity

The costs, in terms of states, of operations on infinite and finite unary regular languages where the languages are represented by nondeterministic finite automata are investigated, in particular, Boolean operations, concatenation, iteration, and λ-free iteration.

Tight Lower Bound for the State Complexity of Shuffle of Regular Languages

It is proved that this bound can be reached for some (not necessarily complete) deterministic finite automata with, respectively, m and n states.

Nondeterministic Descriptional Complexity Of Regular Languages

Bounds are shown for Boolean operations, catenation operations – concatenation, iteration, λ-free iteration – and the reversal on finite and infinite regular languages over unary and arbitrary alphabets.

State Complexity of Regular Languages

  • Sheng Yu
  • Computer Science, Linguistics
    J. Autom. Lang. Comb.
  • 2001
This work investigates the problems related to the state complexity of regular languages and their operations and compares the results on regular languages with those on nite languages.

Unary Language Operations, State Complexity and Jacobsthal's Function

This paper gives the cost, in terms of states, of some basic operations on regular languages in the unary case (where the alphabet contains only one symbol) by explicitly determining the number of states in the noncyclic and cyclic parts of the resulting automata.

State Complexity of Union and Intersection of Finite Languages

The upper bounds based on the structural properties of minimal deterministic finite-state automata for finite languages show that the upper bounds are tight if the authors have a variable sized alphabet that can depend on the size of input DFAs.