Pages that link to "Item:Q2893312"
From MaRDI portal
The following pages link to The computational complexity of universality problems for prefixes, suffixes, factors, and subwords of regular languages (Q2893312):
Displaying 14 items.
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- On NFAs where all states are final, initial, or both (Q1034621) (← links)
- Word problems of groups: formal languages, characterizations and decidability (Q1623276) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- Preimage problems for deterministic finite automata (Q2208257) (← links)
- A tale of two diagnoses in probabilistic systems (Q2280320) (← links)
- Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity (Q2799199) (← links)
- (Q3304147) (← links)
- Scattered Factor-Universality of Words (Q5041246) (← links)
- The Frobenius and Factor Universality Problems of the Kleene Star of a Finite Set of Words (Q5056408) (← links)
- (Q5067948) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Approximate NFA universality and related problems motivated by information theory (Q6093572) (← links)
- Matching patterns with variables under Simon's congruence (Q6623024) (← links)