Pages that link to "Item:Q5200068"
From MaRDI portal
The following pages link to Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata (Q5200068):
Displaying 4 items.
- State complexity of the set of synchronizing words for circular automata and automata over binary alphabets (Q2232292) (← links)
- Computing the shortest reset words of synchronizing automata (Q2354297) (← links)
- Lower Bounds for the Length of Reset Words in Eulerian Automata (Q3172873) (← links)
- (Q5209967) (← links)