Regular Ideal Languages and Synchronizing Automata
From MaRDI portal
Publication:2849990
DOI10.1007/978-3-642-40579-2_22zbMath1398.68328OpenAlexW2275146932MaRDI QIDQ2849990
Publication date: 20 September 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40579-2_22
Related Items
Strongly connected synchronizing automata and the language of minimal reset words ⋮ Ideal regular languages and strongly connected synchronizing automata ⋮ Representation of (Left) Ideal Regular Languages by Synchronizing Automata