On the Shuffle Automaton Size for Words

@article{Biegler2009OnTS,
  title={On the Shuffle Automaton Size for Words},
  author={Franziska Biegler and Mark Daley and Ian McQuillan},
  journal={J. Autom. Lang. Comb.},
  year={2009},
  volume={15},
  pages={53-70}
}
We investigate the state size of DFAs accepting the shuffle of two words. We provide words u and v, such that the minimal DFA for u shuffled with v requires an exponential number of states. We also show some conditions for the words u and v which ensure a quadratic upper bound on the state size of u shuffled with v. Moreover, switching only two letters within one of u or v is enough to trigger the change from quadratic to exponential. 
View PDF on arXiv
9 Citations
Background Citations
4
Methods Citations
2
Results Citations
1

Figures from this paper

9 Citations

On Comparing Deterministic Finite Automata and the Shuffle of Words

This paper provides a polynomial time algorithm to decide whether the language accepted by a deterministic finite automaton is a subset of the shuffle of two words, for the special case when the skeletons of the two words are of fixed length.

Algorithmic decomposition of shuffle on words

State complexity of star of union and square of union on k regular languages

On the complexity and decidability of some problems involving shuffle

Recognizing Shuffled Languages

This work investigates how interleaving can be introduced into models that capture the context-free languages, and studies the complexity of the membership problem for such models.

Araucaria Trees: Construction and Grafting Theorems

A new definition of araucarias is given which is more constructive and it is proved that the new definition is equivalent to the original one.

On the Complexity and Decidability of Some Problems Involving Shuffle

Shuffled languages - Representation and recognition

Complexities of Parsing in the Presence of Reordering

The work presented in this thesis discusses various formalisms for representing the addition of order-controlling and order-relaxing mechanisms to existing formal language models. An immediate exam…

References

SHOWING 1-10 OF 10 REFERENCES

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.

On the uniqueness of shuffle on words and finite languages

Shuffle on Trajectories: Syntactic Constraints

Shuffle Quotient and Decompositions

A right congruence relation is introduced that is the analogy of the Nerode Congruence when catenation is replaced by shuffle that shows that for certain subclasses of regular languages the shuffle decomposition problem is decidable.

An Introduction to Automata Theory

Great Aunt Eugenia and other automata Sundry machines Implementing finite automata Implementation and realization Behavioural equivalence, SP partitions and reduced machines Parallel and serial…

Introduction to Automata Theory, Languages and Computation

NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets

Regular Languages

  • Sheng Yu
  • Mathematics
    Handbook of Formal Languages
  • 1997
The class of regular sets is the smallest class of sets containing the finite sets which is closed under union, concatenation, and Kleene closure and any finite set can be very easily generated by a regular grammar.

Shuffle factorization is unique

Tight Lower Bound for the State Complexity of Shuffle of Regul ar Languages

  • J. of Autom., Lang., and Comb
  • 2002