On comparing deterministic finite automata and the shuffle of words

DOI10.1007/978-3-319-08846-4_7zbMATH Open1302.68151OpenAlexW140590030MaRDI QIDQ3192254FDOQ3192254

Authors: Franziska Biegler, Ian McQuillan 

Publication date: 26 September 2014

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08846-4_7

Recommendations

• Algorithmic decomposition of shuffle on words
• On the complexity and decidability of some problems involving shuffle
• On the complexity and decidability of some problems involving shuffle
• On the shuffle automaton size for words
• On recognizing words that are squares for the shuffle product

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (2)

• On the complexity and decidability of some problems involving shuffle
• Decision problems on copying and shuffling

This page was built for publication: On comparing deterministic finite automata and the shuffle of words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192254)