Pages that link to "Item:Q3734730"
From MaRDI portal
The following pages link to Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif (Q3734730):
Displayed 18 items.
- Recognizable languages in concurrency monoids (Q672317) (← links)
- Logical definability on infinite traces (Q672860) (← links)
- On some equations in free partially commutative monoids (Q1084189) (← links)
- On regular trace languages (Q1097040) (← links)
- Theory of traces (Q1107296) (← links)
- On recognizable subsets of free partially commutative monoids (Q1111703) (← links)
- Recognizable closures and submonoids of free partially commutative monoids (Q1178709) (← links)
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\) (Q1201865) (← links)
- String matching problems over free partially commutative monoids (Q1207940) (← links)
- The star problem and the finite power property in trace monoids: Reductions beyond C4 (Q1854540) (← links)
- Two techniques in the area of the star problem in trace monoids (Q1884907) (← links)
- Overlaps in free partially commutative monoids (Q2639969) (← links)
- An extension of the notions of traces and of asynchronous automata (Q3988805) (← links)
- Parties reconnaissables de monoïdes définis par générateurs et relations (Q4032304) (← links)
- Logical definability on infinite traces (Q4630272) (← links)
- A kleene theorem for recognizable languages over concurrency monoids (Q4632442) (← links)
- Semi-commutations and rational expressions (Q5204311) (← links)
- On the structure of recognizable languages of dependence graphs (Q5286052) (← links)