On infinite words generated by polynomial D0L systems
From MaRDI portal
Publication:5957360
DOI10.1016/S0166-218X(01)00231-1zbMath0993.68077MaRDI QIDQ5957360
Publication date: 6 March 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On infinite words obtained by iterating morphisms
- A short solution for the HDT0L sequence equivalence problem
- The ω sequence problem for DOL systems is decidable
- The decidability of the equivalence problem for DOL-systems
- A polynomial bound for certain cases of the D0L sequence equivalence problem
This page was built for publication: On infinite words generated by polynomial D0L systems