On Comparing Deterministic Finite Automata and the Shuffle of Words

DOI10.1007/978-3-319-08846-4_7zbMath1302.68151OpenAlexW140590030MaRDI QIDQ3192254

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

Mathematics Subject Classification ID

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

Related Items (1)

On the complexity and decidability of some problems involving shuffle

This page was built for publication: On Comparing Deterministic Finite Automata and the Shuffle of Words