Pages that link to "Item:Q6072405"
From MaRDI portal
The following pages link to Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405):
Displaying 5 items.
- (Q4273661) (← links)
- (Q4782023) (← links)
- Interaction graphs of isomorphic automata networks. I: Complete digraph and minimum in-degree (Q6133643) (← links)
- Binary and circular automata having maximal state complexity for the set of synchronizing words (Q6186314) (← links)
- New characterizations of primitive permutation groups with applications to synchronizing automata (Q6186315) (← links)