Structural properties of shuffle automata

Grammars

Volumn 2, Issue 1, 1999, Pages 35-51

  Jȩdrzejowicz, Joanna ^a  

^a UNIVERSITY OF GDA SK   (Poland)

Author keywords

Automata and formal languages; Kleene theorem; Shuffle automata; Shuffle expressions

Indexed keywords

EID: 26844434148     PISSN: 13861793     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. 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.
2. Hopcroft, J. E. and J. D. Ullman, Introduction to Automata Theory, Languages and Computation Addison-Wesley, Reading MA, 1979.
3. Jantzen, M. The power of synchronizing operations on strings. Theoret. Comput. Sci., 14: 127-154, 1981.
4. Jȩdrzejowicz, 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.
5. Jȩdrzejowicz, J. Shuffle Operation in Formal Languages, Wydawnictwo Uniwersytetu Gdanskiego, 1996.
6. Jȩdrzejowicz, J. and A. Szepietowski, Shuffle languages are in P, to appear in Theoret. Comput. Sci.
7. Mayer, A. J. and L. J. Stockmeyer, The complexity of word problems - this time with interleaving, Inform, and Comput. 115: 293-311, 1994.
8. Warmuth, M. K. and D. Haussler, On the complexity of iterated shuffle, J. Comput. Syst. Sci. 28: 345-358, 1984.