Decidability of the star problem in \(A^*\times{}\{ b\}^*\) (Q1201865): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:30, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decidability of the star problem in \(A^*\times{}\{ b\}^*\) |
scientific article |
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
