Pages that link to "Item:Q4932068"
From MaRDI portal
The following pages link to On the State Complexity of Scattered Substrings and Superstrings (Q4932068):
Displaying 11 items.
- Decidability of involution hypercodes (Q401315) (← links)
- On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
- Quotient complexity of closed languages (Q1678754) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Commutative regular languages with product-form minimal automata (Q2096583) (← links)
- State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages (Q2096584) (← links)
- Language operations with regular expressions of polynomial size (Q2271463) (← links)
- State complexity of pattern matching in regular languages (Q2422023) (← links)
- Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity (Q2799199) (← links)
- On the State Complexity of the Shuffle of Regular Languages (Q2829972) (← links)
- Further closure properties of input-driven pushdown automata (Q5919707) (← links)
