On Completely Reachable Automata and Subset Reachability
(2018) DLT 2018 — Location: Tokyo, Japan (10.September.2018)
Files
180502540.pdf
Closed Access - Adobe PDF
- 202.57 KB
Details
- Authors
- Abstract
- This article focuses on subset reachability in synchronizing automata. First, we provide families of synchronizing automata with subsets which cannot be reached with short words. These families do not fulfil Don's Conjecture about subset reachability. Moreover, they show that some subsets need exponentially long words to be reached, and that the restriction of the conjecture to included subsets also does not hold. Second, we analyze completely reachable automata and provide a counterexample to the conjecture of Bondar and Volkov about the so-called $\Gamma_1$-graph. We finally prove an alternative version of this conjecture. On Completely Reachable Automata and Subset Reachability | Request PDF. Available from: https://www.researchgate.net/publication/325008732_On_Completely_Reachable_Automata_and_Subset_Reachability [accessed Sep 20 2018].
- Affiliations
Citations
Gonze, F., & Jungers, R. (2018). On Completely Reachable Automata and Subset Reachability. DLT 2018, Tokyo, Japan. https://hdl.handle.net/2078.5/227794