Pages that link to "Item:Q3528408"
From MaRDI portal
The following pages link to Learning Commutative Regular Languages (Q3528408):
Displayed 6 items.
- Computational complexity of synchronization under regular commutative constraints (Q2019491) (← 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)
- The commutative closure of shuffle languages over group languages is regular (Q2117662) (← links)
- Constrained synchronization and commutativity (Q2235741) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)