Note on Reversal of Binary Regular Languages
From MaRDI portal
Publication:5200093
DOI10.1007/978-3-642-22600-7_17zbMath1341.68097MaRDI QIDQ5200093
Publication date: 29 July 2011
Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22600-7_17
regular languages; state complexity; reversal; deterministic union-free languages; nondeterministic state complexity
68Q45: Formal languages and automata