Decidability of the star problem in \(A^*\times{}\{ b\}^*\)
From MaRDI portal
Publication:1201865
DOI10.1016/0020-0190(92)90187-ZzbMath0759.68050OpenAlexW1511714024MaRDI QIDQ1201865
Paul Gastin, Antoine Petit, Brigitte Rozoy, Edward Ochmański
Publication date: 17 January 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(92)90187-z
Related Items (4)
Two techniques in the area of the star problem in trace monoids ⋮ Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable ⋮ Computing the closure of sets of words under partial commutations ⋮ The star problem and the finite power property in trace monoids: Reductions beyond C4
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximal serializability of iterated transactions
- An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
- Semi-commutations
- Theory of traces
- A decision procedure for the order of regular events
- Recognizable closures and submonoids of free partially commutative monoids
- Combinatorics on traces
- Matrices de Hankel
- Recognizable subsets of some partially Abelian monoids
- Semigroups, Presburger formulas, and languages
- Combinatorial problems of commutation and rearrangements
- Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
- ON THE STAR OPERATION IN FREE PARTIALLY COMMUTATIVE MONOIDS
- Bounded Regular Sets
This page was built for publication: Decidability of the star problem in \(A^*\times{}\{ b\}^*\)
