Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
From MaRDI portal
Publication:3734730
DOI10.1051/ita/1986200201211zbMath0599.20107OpenAlexW2408334883MaRDI QIDQ3734730
Publication date: 1986
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/92251
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
On some equations in free partially commutative monoids ⋮ On the structure of recognizable languages of dependence graphs ⋮ Two techniques in the area of the star problem in trace monoids ⋮ On regular trace languages ⋮ An extension of the notions of traces and of asynchronous automata ⋮ Overlaps in free partially commutative monoids ⋮ Theory of traces ⋮ On recognizable subsets of free partially commutative monoids ⋮ Parties reconnaissables de monoïdes définis par générateurs et relations ⋮ Recognizable closures and submonoids of free partially commutative monoids ⋮ A kleene theorem for recognizable languages over concurrency monoids ⋮ Recognizable languages in concurrency monoids ⋮ Logical definability on infinite traces ⋮ Decidability of the star problem in \(A^*\times{}\{ b\}^*\) ⋮ String matching problems over free partially commutative monoids ⋮ Semi-commutations and rational expressions ⋮ The star problem and the finite power property in trace monoids: Reductions beyond C4 ⋮ Logical definability on infinite traces
Cites Work
