Pages that link to "Item:Q896684"
From MaRDI portal
The following pages link to On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684):
Displayed 6 items.
- Counting the number of non-zero coefficients in rows of generalized Pascal triangles (Q512556) (← 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)
- Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
- (Q5376657) (← links)
- Further closure properties of input-driven pushdown automata (Q5919707) (← links)