On the uniqueness of shuffle on words and finite languages
From MaRDI portal
Publication:837162
DOI10.1016/j.tcs.2009.04.016zbMath1343.68132OpenAlexW2049709665MaRDI QIDQ837162
Mark Daley, Franziska Biegler, Markus Holzer, Ian McQuillan
Publication date: 10 September 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.04.016
Related Items (4)
Tree shuffle ⋮ On the complexity and decidability of some problems involving shuffle ⋮ Algorithmic decomposition of shuffle on words ⋮ Language equations
Cites Work
This page was built for publication: On the uniqueness of shuffle on words and finite languages
