The ω sequence problem for DOL systems is decidable (Q3769989)
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: The ω sequence problem for DOL systems is decidable |
scientific article; zbMATH DE number 4028934
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The ω sequence problem for DOL systems is decidable |
scientific article; zbMATH DE number 4028934 |
Statements
The ω sequence problem for DOL systems is decidable (English)
0 references
1984
0 references
parallel rewriting systems
0 references
infinite words
0 references
homomorphisms
0 references
decidability
0 references
limit language equivalence
0 references
\(\omega \)-equivalence
0 references
D0L systems
0 references
0.910711944103241
0 references
0.9055922627449036
0 references
0.8573653101921082
0 references
