A bound for theω-equivalence problem of polynomial D0L systems
From MaRDI portal
Publication:4825477
Recommendations
- The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet
- A polynomial bound for certain cases of the D0L sequence equivalence problem
- The ω sequence problem for DOL systems is decidable
- Dynamical equivalence and unbounded polynomial differential systems
- scientific article; zbMATH DE number 989722
- THE D0L ω-EQUIVALENCE PROBLEM
- An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet
- scientific article; zbMATH DE number 3834104
- Boundedness and unboundedness in polynomial differential systems
Cites work
- Elementary homomorphisms and a solution of the DOL sequence equivalence problem
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3802813 (Why is no real title available?)
- scientific article; zbMATH DE number 3421926 (Why is no real title available?)
- On infinite words generated by polynomial D0L systems
- On infinite words obtained by iterating morphisms
- REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM
- The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet
- The ω sequence problem for DOL systems is decidable
Cited in
(3)
This page was built for publication: A bound for theω-equivalence problem of polynomial D0L systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4825477)
