Pages that link to "Item:Q2112183"
From MaRDI portal
The following pages link to Reset complexity and completely reachable automata with simple idempotents (Q2112183):
Displaying 4 items.
- Cerny's conjecture for automata with simple idempotents (Q2132068) (← links)
- (Q5209967) (← links)
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405) (← links)
- Binary and circular automata having maximal state complexity for the set of synchronizing words (Q6186314) (← links)