Nesting of shuffle closure is important

DOI10.1016/0020-0190(87)90213-4zbMath0633.68070OpenAlexW2113070456MaRDI QIDQ1096398

Joanna Jȩdrzejowicz

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90213-4

zbMATH Keywords

shuffle languagesshuffle closureshuffle operator

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Infinite hierarchy of expressions containing shuffle closure operator ⋮ Infinite hierarchy of shuffle expressions over a finite alphabet ⋮ Lower Space Bounds for Accepting Shuffle Languages ⋮ Shuffle and scattered deletion closure of languages ⋮ Shuffle languages are in P

Cites Work

• On the enlargement of the class of regular languages by the shuffle closure
• Extending regular expressions with iterated shuffle
• Relations of flow languages to Petri net languages
• Shuffle languages, Petri nets, and context-sensitive grammars

This page was built for publication: Nesting of shuffle closure is important