An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet (Q2575836)
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 2235957
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet |
scientific article; zbMATH DE number 2235957 |
Statements
An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet (English)
0 references
7 December 2005
0 references
D0L system
0 references
Equivalence problem
0 references
Ultimate equivalence problem
0 references
Decidability
0 references
0 references
0.8947184681892395
0 references
0.8895889520645142
0 references
0.8847609162330627
0 references
0.8752039074897766
0 references
0.8494650721549988
0 references
