Pages that link to "Item:Q2424693"
From MaRDI portal
The following pages link to Complexity of road coloring with prescribed reset words (Q2424693):
Displaying 9 items.
- Constrained synchronization and subset synchronization problems for weakly acyclic automata (Q832939) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Computational complexity of synchronization under sparse regular constraints (Q2140506) (← links)
- Synchronizing sequences for road colored digraphs (Q2197412) (← links)
- Constrained synchronization and commutativity (Q2235741) (← links)
- Special issue: Selected papers of the 9th international conference on language and automata theory and applications, LATA 2015 (Q2424669) (← links)
- Ideal separation and general theorems for constrained synchronization and their application to small constraint automata (Q2695284) (← links)
- (Q2799170) (redirect page) (← links)
- On the Number of Synchronizing Colorings of Digraphs (Q2947415) (← links)
