On recognizable subsets of free partially commutative monoids
From MaRDI portal
DOI10.1016/0304-3975(88)90027-8zbMATH Open0658.20031OpenAlexW1576513528MaRDI QIDQ1111703FDOQ1111703
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
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
Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recognizable subsets of some partially Abelian monoids
- Title not available (Why is that?)
- Combinatorial problems of commutation and rearrangements
- Title not available (Why is that?)
- Title not available (Why is that?)
- Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
- Maximal serializability of iterated transactions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inhomogeneous sorting
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
- Title not available (Why is that?)
- Some trace monoids where both the star problem and the finite power property problem are decidable (extended abstract)
- Recognizable subsets of the two letter plactic monoid
- 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
- Title not available (Why is that?)
- An extension of Kleene's and Ochmański's theorems to infinite traces
- Infinite-state high-level MSCs: model-checking and realizability
- Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
- Recognizable closures and submonoids of free partially commutative monoids
- Recognizable subsets of some partially Abelian monoids
- Computing the closure of sets of words under partial commutations
- String matching problems over free partially commutative monoids
- Overlaps in free partially commutative monoids
- Title not available (Why is that?)
- On the decidability of some problems about rational subsets of free partially commutative monoids
- Title not available (Why is that?)
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)
