Pages that link to "Item:Q5250279"
From MaRDI portal
The following pages link to Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata (Q5250279):
Displaying 3 items.
- 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)
- Synchronization problems in automata without non-trivial cycles (Q5919579) (← links)
