The ω sequence problem for DOL systems is decidable (Q3769989): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:38, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The ω sequence problem for DOL systems is decidable |
scientific article |
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
