Undecidability of the State Complexity of Composed Regular Operations
From MaRDI portal
Publication:3004607
DOI10.1007/978-3-642-21254-3_39zbMath1330.68179MaRDI QIDQ3004607
Arto Salomaa, Kai Salomaa, Sheng Yu
Publication date: 3 June 2011
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21254-3_39
undecidability; state complexity; finite deterministic automaton; regularity-preserving operations; composition of operations
68Q45: Formal languages and automata