Recognizable subsets of some partially Abelian monoids
From MaRDI portal
Publication:2266128
DOI10.1016/0304-3975(85)90013-1zbMath0559.20040OpenAlexW1969380902MaRDI QIDQ2266128
Publication date: 1985
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(85)90013-1
Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
Asynchronous automata versus asynchronous cellular automata, On some equations in free partially commutative monoids, A decision procedure on partially commutative free monoids, Pattern matching in trace monoids, Semi-commutations, On regular trace languages, Mixed product and asynchronous automata, Overlaps in free partially commutative monoids, Efficient solution of some problems in free partially commutative monoids, Theory of traces, On lexicographic semi-commutations, 2-asynchronous automata, On recognizable subsets of free partially commutative monoids, Complete subgraphs of bipartite graphs and applications to trace languages, On confluence of one-rule trace-rewriting systems, Semi-trace morphisms and rational transductions, Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable, Notes on finite asynchronous automata, Parties reconnaissables de monoïdes définis par générateurs et relations, Hopf algebras and identities in free partially commutative monoids, Recognizable closures and submonoids of free partially commutative monoids, A kleene theorem for recognizable languages over concurrency monoids, Event structures and trace monoids, Recognizable languages in concurrency monoids, On some decision problems for trace codings, Parabolic and quasiparabolic subgroups of free partially commutative groups., Star-free trace languages, Decidability of the star problem in \(A^*\times{}\{ b\}^*\), String matching problems over free partially commutative monoids, On Dynkin and Klyachko idempotents in graded bialgebras, Compositions de fonctions de commutation partielle, On the Knuth-Bendix completion for concurrent processes, Characterizations of the decidability of some problems for regular trace languages, On the synchronization of traces, Recognizable trace languages, distributed automata and the distribution problem
Cites Work
