Pages that link to "Item:Q989550"
From MaRDI portal
The following pages link to Improved upper bounds on synchronizing nondeterministic automata (Q989550):
Displaying 3 items.
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata (Q1678755) (← links)
- Distributed graph problems through an automata-theoretic Lens (Q2117706) (← links)
- Distributed graph problems through an automata-theoretic lens (Q2689441) (← links)
