Pages that link to "Item:Q4852676"
From MaRDI portal
The following pages link to RANK PROBLEMS FOR COMPOSITE TRANSFORMATIONS (Q4852676):
Displaying 9 items.
- Synchronizing automata preserving a chain of partial orders (Q840772) (← links)
- On automata recognizing birecurrent sets (Q1625603) (← links)
- Approximating the minimum length of synchronizing words is hard (Q1678749) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Completely Reachable Automata (Q2829965) (← links)
- Synchronizing Automata Preserving a Chain of Partial Orders (Q3503892) (← links)
- Synchronizing Automata and the Černý Conjecture (Q3540093) (← links)
- Les automates circulaires biaisés vérifient la conjecture de Černý (Q4341035) (← links)
- Synchronizing words and monoid factorization, yielding a new parameterized complexity class? (Q5048011) (← links)
