On recognizable subsets of free partially commutative monoids

DOI10.1016/0304-3975(88)90027-8MaRDI QIDQ1111703zbMATH OpenOpenAlexFDO

Authors Yves Métivier

Publication date 1988

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(88)90027-8

zbMATH Keywords

wordsfinite alphabetrecognizablefree partially abelian monoid

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• scientific article; zbMATH DE number 3956459
• Recognizable subsets of some partially Abelian monoids
• ON THE STAR OPERATION IN FREE PARTIALLY COMMUTATIVE MONOIDS
• On the decidability of some problems about rational subsets of free partially commutative monoids
• Recognizable closures and submonoids of free partially commutative monoids

Cites work

• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 3970130 (Why is no real title available?)
• scientific article; zbMATH DE number 3972221 (Why is no real title available?)
• scientific article; zbMATH DE number 4002104 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3765179 (Why is no real title available?)
• scientific article; zbMATH DE number 3251424 (Why is no real title available?)
• Combinatorial problems of commutation and rearrangements
• Inhomogeneous sorting
• Maximal serializability of iterated transactions
• Recognizable subsets of some partially Abelian monoids
• Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif

Cited in

(23)

• Parties reconnaissables de monoïdes définis par générateurs et relations
• Permutation rewriting and algorithmic verification
• On free partially commutative monoids
• scientific article; zbMATH DE number 3956459 (Why is no real title available?)
• Recognizable subsets of the two letter plactic monoid
• Some trace monoids where both the star problem and the finite power property problem are decidable (extended abstract)
• Asynchronous automata versus asynchronous cellular automata
• ON THE STAR OPERATION IN FREE PARTIALLY COMMUTATIVE MONOIDS
• Recognizable subsets of semigroups
• Shared-memory systems and charts
• Two recognizable string-matching problems over free partially commutative monoids
• An extension of Kleene's and Ochmański's theorems to infinite traces
• scientific article; zbMATH DE number 2028929 (Why is no real title available?)
• Infinite-state high-level MSCs: model-checking and realizability
• Recognizable closures and submonoids of free partially commutative monoids
• Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
• Recognizable subsets of some partially Abelian monoids
• String matching problems over free partially commutative monoids
• Computing the closure of sets of words under partial commutations
• Overlaps in free partially commutative monoids
• scientific article; zbMATH DE number 4162275 (Why is no real title available?)
• On the decidability of some problems about rational subsets of free partially commutative monoids
• scientific article; zbMATH DE number 3970130 (Why is no real title available?)

This page was built for publication: On recognizable subsets of free partially commutative monoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111703)