Two techniques in the area of the star problem (Q4938642)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1405661
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two techniques in the area of the star problem |
scientific article; zbMATH DE number 1405661 |
Statements
2 August 2000
0 references
trace monoids
0 references
trace languages
0 references
recognizability
0 references
star problem
0 references
0.9039857983589172
0 references
0.8910852074623108
0 references
0.8831175565719604
0 references
0.8826019763946533
0 references
0.8642358183860779
0 references
Two techniques in the area of the star problem (English)
0 references
Trace monoids of the form \(\Sigma^*\times\Gamma^*\) for two disjoint alphabets \(\Sigma\), \(\Gamma\) are studied. The elements of the set \(\Sigma^*\times\Gamma^*\) are called traces and its subsets are trace languages. The recognizability of a trace language by an automaton is defined. The star problem is the problem, whether the language \(P^*\) for a recognizable language \(P\) is recognizable. This problem remains open and the paper contains some partial results in this direction. For the entire collection see [Zbl 0917.00014].
0 references
