On the Images of ℕ-Rational Sequences Counting Multiplicities

DOI10.1142/S0218196703001390zbMath1103.68579MaRDI QIDQ3043616

Keijo Ruohonen, Juha Honkala

Publication date: 6 August 2004

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

\(\mathbb N\)-rational sequencesHD0L language equivalence problemimages of \(\mathbb N\)-rational sequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Recurrences (11B37) Algebraic theory of languages and automata (68Q70) Arithmetic progressions (11B25)

Related Items

Decidability questions related to abstract numeration systems, Lindenmayer Systems, Decidability results for Watson-Crick D0L systems with nonregular triggers., The language equivalence problem for HD0L systems having D0L growths, Explicit test sets for iterated morphisms in free monoids and metabelian groups

Cites Work

• Unnamed Item
• A simple proof of the Skolem-Mahler-Lech theorem
• On equality of multiplicity sets of regular languages
• A short solution for the HDT0L sequence equivalence problem
• Watson-Crick D0L systems with regular triggers