The ω sequence problem for DOL systems is decidable (Q3769989): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Tero J.Harju / rank | |||
| Property / author | |||
| Property / author: Tero J.Harju / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/62.2161 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2020466367 / rank | |||
Normal rank | |||
Latest revision as of 19:47, 19 March 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
