Decidability of the star problem in \(A^*\times{}\{ b\}^*\) (Q1201865)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decidability of the star problem in \(A^*\times{}\{ b\}^*\) |
scientific article; zbMATH DE number 98609
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decidability of the star problem in \(A^*\times{}\{ b\}^*\) |
scientific article; zbMATH DE number 98609 |
Statements
Decidability of the star problem in \(A^*\times{}\{ b\}^*\) (English)
0 references
17 January 1993
0 references
The Star problem in trace monoids is the following problem: Let \(L\) be a recognizable trace language, is \(L^*\) recognizable? It is proved that this problem is decidable when the trace monoid is a direct product of free monoids \(A^*\times\{b\}^*\).
0 references
rational languages
0 references
decidability
0 references
0 references
