DOI10.1016/j.tcs.2012.05.008zbMath1262.68045MaRDI QIDQ443743
Galina Jirásková, Juraj Šebej
Publication date: 13 August 2012 Published in: Theoretical Computer Science (Search for Journal in Brave) Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.008
zbMATH Keywords
regular languages; descriptional complexity; reversal; deterministic union-free languages
Mathematics Subject Classification ID
68Q45: Formal languages and automata
68Q19: Descriptive complexity and finite models