Lower Bounds for the Length of Reset Words in Eulerian Automata
From MaRDI portal
Publication:3172873
DOI10.1007/978-3-642-24288-5_16zbMath1348.68104OpenAlexW2181041555MaRDI QIDQ3172873
Publication date: 7 October 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10995/27138
Related Items
Synchronizing Automata of Bounded Rank, Primitive digraphs with large exponents and slowly synchronizing automata, Attainable Values of Reset Thresholds