Pages that link to "Item:Q6072405"

The following pages link to Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees (Q6072405):

Displaying 2 items.

• 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)