Pages that link to "Item:Q2354297"
From MaRDI portal
The following pages link to Computing the shortest reset words of synchronizing automata (Q2354297):
Displayed 12 items.
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Careful synchronization of partial deterministic finite automata (Q2170286) (← links)
- Preimage problems for deterministic finite automata (Q2208257) (← links)
- Complexity of road coloring with prescribed reset words (Q2424693) (← links)
- Using SAT solvers for synchronization issues in non-deterministic automata (Q2633380) (← links)
- An Extremal Series of Eulerian Synchronizing Automata (Q2817403) (← links)
- Checking Whether an Automaton Is Monotonic Is NP-complete (Q2947429) (← links)
- Complexity of Preimage Problems for Deterministic Finite Automata (Q5005132) (← links)
- Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
- Synchronizing words and monoid factorization, yielding a new parameterized complexity class? (Q5048011) (← links)
- Attainable Values of Reset Thresholds (Q5111255) (← links)
- D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA (Q5125223) (← links)