Lower Bounds for the Length of Reset Words in Eulerian Automata
From MaRDI portal
Publication:3172873
DOI10.1007/978-3-642-24288-5_16zbMATH Open1348.68104OpenAlexW2181041555MaRDI QIDQ3172873FDOQ3172873
Authors: Vladimir V. Gusev 
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
Recommendations
- Lower bounds for the length of reset words in Eulerian automata
- Complexity of a problem concerning reset words for Eulerian binary automata
- Complexity of a problem concerning reset words for Eulerian binary automata
- Complexity of problems concerning reset words for cyclic and Eulerian automata
- Complexity of problems concerning reset words for cyclic and Eulerian automata
- scientific article; zbMATH DE number 846959
- scientific article; zbMATH DE number 897906
- The complexity of finding reset words in finite automata
- Estimation of the length of reset words for automata with simple idempotents
- Complexity of problems concerning reset words for some partial cases of automata
Cited In (8)
- A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number
- Synchronizing automata of bounded rank
- Attainable values of reset thresholds
- Lower bounds for the length of reset words in Eulerian automata
- A new lower bound for reset threshold of binary synchronizing automata with sink
- An extremal series of Eulerian synchronizing automata
- Title not available (Why is that?)
- Primitive digraphs with large exponents and slowly synchronizing automata
This page was built for publication: Lower Bounds for the Length of Reset Words in Eulerian Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172873)
