Constructing the maximum prefix-closed subset for a set of \(-\omega \)-words defined by a \(-\omega \)-regular expression (Q6198088)
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: Constructing the maximum prefix-closed subset for a set of \(-\omega \)-words defined by a \(-\omega \)-regular expression |
scientific article; zbMATH DE number 7806783
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing the maximum prefix-closed subset for a set of \(-\omega \)-words defined by a \(-\omega \)-regular expression |
scientific article; zbMATH DE number 7806783 |
Statements
Constructing the maximum prefix-closed subset for a set of \(-\omega \)-words defined by a \(-\omega \)-regular expression (English)
0 references
20 February 2024
0 references
\(-\omega \)-word
0 references
\(-\omega \)-regular expression
0 references
prefix-closed set of \(-\omega \)-words
0 references
graph of elementary extensions
0 references
linear equation over \(-\omega \)-regular sets
0 references
0 references
0 references
