EQUALITY SETS OF MORPHIC WORD SEQUENCES
From MaRDI portal
Publication:2841980
DOI10.1142/S0129054112500268zbMath1285.68087MaRDI QIDQ2841980
Publication date: 30 July 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items (1)
Cites Work
- On some decidability problems for HDOL systems with nonsingular Parikh matrices
- The ultimate equivalence problem for DOL systems
- Elementary homomorphisms and a solution of the DOL sequence equivalence problem
- A short solution for the HDT0L sequence equivalence problem
- Explicit test sets for iterated morphisms in free monoids and metabelian groups
- A Skolem-Mahler-Lech theorem in positive characteristic and finite automata
- D0L sequence equivalence is inPfor fixed alphabets
- On the equivalence problem for binary DOL systems
- The decidability of the equivalence problem for DOL-systems
This page was built for publication: EQUALITY SETS OF MORPHIC WORD SEQUENCES