Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable
From MaRDI portal
Publication:5096916
DOI10.1007/3-540-58338-6_104zbMath1496.20089OpenAlexW1494078315MaRDI QIDQ5096916
Publication date: 18 August 2022
Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-58338-6_104
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (3)
Two techniques in the area of the star problem in trace monoids ⋮ A note on the commutative closure of star-free languages ⋮ Computing the closure of sets of words under partial commutations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximal serializability of iterated transactions
- On recognizable subsets of free partially commutative monoids
- A decision procedure for the order of regular events
- Recognizable closures and submonoids of free partially commutative monoids
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\)
- Matrices de Hankel
- Recognizable subsets of some partially Abelian monoids
- Semigroups, Presburger formulas, and languages
- Combinatorial problems of commutation and rearrangements
- ON THE STAR OPERATION IN FREE PARTIALLY COMMUTATIVE MONOIDS
- Bounded Regular Sets
This page was built for publication: Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable
