Pages that link to "Item:Q2266128"
From MaRDI portal
The following pages link to Recognizable subsets of some partially Abelian monoids (Q2266128):
Displayed 31 items.
- Recognizable languages in concurrency monoids (Q672317) (← links)
- On some decision problems for trace codings (Q672324) (← links)
- On Dynkin and Klyachko idempotents in graded bialgebras (Q696821) (← links)
- Hopf algebras and identities in free partially commutative monoids (Q909485) (← links)
- On some equations in free partially commutative monoids (Q1084189) (← links)
- A decision procedure on partially commutative free monoids (Q1086682) (← links)
- Semi-commutations (Q1094144) (← links)
- On regular trace languages (Q1097040) (← links)
- Mixed product and asynchronous automata (Q1099643) (← links)
- Theory of traces (Q1107296) (← links)
- On lexicographic semi-commutations (Q1108811) (← links)
- 2-asynchronous automata (Q1109571) (← links)
- On recognizable subsets of free partially commutative monoids (Q1111703) (← links)
- Recognizable closures and submonoids of free partially commutative monoids (Q1178709) (← links)
- Event structures and trace monoids (Q1183599) (← links)
- Star-free trace languages (Q1193878) (← links)
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\) (Q1201865) (← links)
- String matching problems over free partially commutative monoids (Q1207940) (← links)
- On the Knuth-Bendix completion for concurrent processes (Q1262753) (← links)
- Recognizable trace languages, distributed automata and the distribution problem (Q1323363) (← links)
- Asynchronous automata versus asynchronous cellular automata (Q1334661) (← links)
- Parabolic and quasiparabolic subgroups of free partially commutative groups. (Q2470378) (← links)
- Overlaps in free partially commutative monoids (Q2639969) (← links)
- Efficient solution of some problems in free partially commutative monoids (Q2640345) (← links)
- Compositions de fonctions de commutation partielle (Q3031949) (← links)
- Complete subgraphs of bipartite graphs and applications to trace languages (Q3479529) (← links)
- Notes on finite asynchronous automata (Q3761703) (← links)
- Parties reconnaissables de monoïdes définis par générateurs et relations (Q4032304) (← links)
- Characterizations of the decidability of some problems for regular trace languages (Q4729376) (← links)
- On the synchronization of traces (Q4733415) (← links)
- On confluence of one-rule trace-rewriting systems (Q4841768) (← links)