The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet (Q1405801)
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 equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet |
scientific article; zbMATH DE number 1971500
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet |
scientific article; zbMATH DE number 1971500 |
Statements
The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet (English)
0 references
26 August 2003
0 references
sequence equivalence problem
0 references
