The following pages link to (Q4452055):
Displaying 9 items.
- Synchronizing sequences on a class of unbounded systems using synchronized Petri nets (Q262433) (← links)
- Černý conjecture for edge-colored digraphs with few junctions (Q510555) (← links)
- Synchronizing monotonic automata (Q703567) (← links)
- Synchronizing finite automata with short reset words (Q1008633) (← links)
- Sync-maximal permutation groups equal primitive permutation groups (Q2096582) (← links)
- Computing the shortest reset words of synchronizing automata (Q2354297) (← links)
- Checking Whether an Automaton Is Monotonic Is NP-complete (Q2947429) (← links)
- Genetic Algorithm for Synchronization (Q3618622) (← links)
- Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata (Q5448671) (← links)
