On the expressive power of the shuffle operator matched with intersection by regular sets
DOI10.1051/ITA:2001125zbMATH Open0994.68084OpenAlexW2151713665MaRDI QIDQ4331053FDOQ4331053
Authors: Joanna Jȩdrzejowicz, Andrzej Szepietowski 
Publication date: 3 June 2002
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2001__35_4_379_0
Recommendations
Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Title not available (Why is that?)
- Shuffle languages are in P
- Title not available (Why is that?)
- Very special languages and representations of recursively enumerable languages via computation histories
- Software Descriptions with Flow Expressions
- On the complexity of iterated shuffle
- Flow languages equal recursively enumerable languages
- Title not available (Why is that?)
Cited In (8)
- On the complexity and decidability of some problems involving shuffle
- The expressive power of the shuffle product
- Extending regular expressions with iterated shuffle
- String shuffle: circuits and graphs
- Unshuffling a square is NP-hard
- On shuffling a word with its letter-to-letter substitution
- On the interdependence between shuffle and crossing-over operations
- Shuffled languages -- representation and recognition
This page was built for publication: On the expressive power of the shuffle operator matched with intersection by regular sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4331053)
