Skip to main content
Log in

Structural Properties of Shuffle Automata

  • Published:
Grammars

Abstract

In this paper we prove a Kleene type theorem for shuffle automata. We show that for each shuffle automaton in standard form one can define a shuffle expression denoting the language of the automaton.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Abrahamson, K., L. Cai and S. Gordon. A grammar characterization of logarithmic space computation. In G. Paun, A. Salomaa, editors, New Trends in Formal Languages, 247–255. Lecture Notes in Computer Science 1218, 1997.

  • Hopcroft, J. E. and J. D. Ullman, Introduction to Automata Theory, Languages and Computation Addison-Wesley, Reading MA, 1979.

    Google Scholar 

  • Jantzen, M. The power of synchronizing operations on strings. Theoret. Comput. Sci., 14: 127–154,1981.

    Article  Google Scholar 

  • Jedrzejowicz, J. An undecidable problem for shuffle languages. In J. Dassow, G. Rozenberg and A. Salomaa, editors, Proc. Developments in Language Theory '95, 112–118. World Scientific, Singapore 1996.

    Google Scholar 

  • Jedrzejowicz, J. Shuffle Operation in Formal Languages, Wydawnictwo Uniwersytetu Gdanskiego,1996.

    Google Scholar 

  • Jedrzejowicz, J. and A. Szepietowski, Shuffle languages are in P, to appear in Theoret. Comput. Sci.

  • Mayer, A. J. and L. J. Stockmeyer, The complexity of word problems — this time with interleaving, Inform. and Comput. 115: 293–311, 1994.

    Article  Google Scholar 

  • Warmuth, M. K. and D. Haussler, On the complexity of iterated shuffle, J. Comput. Syst. Sci. 28:345–358, 1984.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jedrzejowicz, J. Structural Properties of Shuffle Automata. Grammars 2, 35–51 (1999). https://doi.org/10.1023/A:1009973609765

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009973609765

Navigation