Pages that link to "Item:Q5919579"
From MaRDI portal
The following pages link to Synchronization problems in automata without non-trivial cycles (Q5919579):
Displaying 9 items.
- Constrained synchronization and subset synchronization problems for weakly acyclic automata (Q832939) (← links)
- State complexity of permutation and related decision problems on alphabetical pattern constraints (Q2117669) (← links)
- Learning from positive and negative examples: dichotomies and parameterized algorithms (Q2169975) (← links)
- Constrained synchronization and commutativity (Q2235741) (← links)
- (Q5005121) (← links)
- Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
- Synchronization problems in automata without non-trivial cycles (Q5919579) (← links)
- (Q5920057) (redirect page) (← links)
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752) (← links)
