Pages that link to "Item:Q1178709"
From MaRDI portal
The following pages link to Recognizable closures and submonoids of free partially commutative monoids (Q1178709):
Displaying 9 items.
- Two recognizable string-matching problems over free partially commutative monoids (Q1190454) (← links)
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\) (Q1201865) (← links)
- String matching problems over free partially commutative monoids (Q1207940) (← links)
- An extension of Kleene's and Ochmański's theorems to infinite traces (Q1318685) (← links)
- On regular compatibility of semi-commutations (Q4630282) (← links)
- Computing the closure of sets of words under partial commutations (Q4645168) (← links)
- Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable (Q5096916) (← links)
- The Generalized Rank of Trace Languages (Q5384435) (← links)
- Reordering Derivatives of Trace Closures of Regular Languages. (Q5875402) (← links)
