A bound for theω-equivalence problem of polynomial D0L systems
From MaRDI portal
Publication:4825477
DOI10.1051/ITA:2003015zbMATH Open1112.68394OpenAlexW2163109167MaRDI QIDQ4825477FDOQ4825477
Authors: Juha Honkala 
Publication date: 28 October 2004
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2003__37_2_149_0
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Elementary homomorphisms and a solution of the DOL sequence equivalence problem
- On infinite words generated by polynomial D0L systems
- The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet
- On infinite words obtained by iterating morphisms
- Title not available (Why is that?)
- The ω sequence problem for DOL systems is decidable
- REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM
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)
