Pages that link to "Item:Q553302"
From MaRDI portal
The following pages link to Decision problems for convex languages (Q553302):
Displaying 10 items.
- Syntactic complexity of regular ideals (Q722210) (← links)
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- Quotient complexity of closed languages (Q1678754) (← links)
- Syntactic complexity of suffix-free languages (Q1706151) (← links)
- Checking Whether an Automaton Is Monotonic Is NP-complete (Q2947429) (← links)
- Decision Problems for Convex Languages (Q3618584) (← links)
- Complexity of bifix-free regular languages (Q5919577) (← links)
- Complexity of bifix-free regular languages (Q5920053) (← links)
- Decision problems for subregular classes (Q6666796) (← links)
