Pages that link to "Item:Q2013561"
From MaRDI portal
The following pages link to Complexity of universality and related problems for partially ordered NFAs (Q2013561):
Displaying 9 items.
- Constrained synchronization and subset synchronization problems for weakly acyclic automata (Q832939) (← links)
- Complexity of deciding detectability in discrete event systems (Q1797011) (← links)
- On verification of D-detectability for discrete event systems (Q2065231) (← links)
- State complexity of permutation and related decision problems on alphabetical pattern constraints (Q2117669) (← links)
- (Q4989409) (← links)
- Scattered Factor-Universality of Words (Q5041246) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752) (← links)
- Matching patterns with variables under Simon's congruence (Q6623024) (← links)
