On the Images of ℕ-Rational Sequences Counting Multiplicities

DOI10.1142/S0218196703001390MaRDI QIDQ3043616zbMATH OpenFDO

Authors Keijo Ruohonen, Juha Honkala

Publication date 6 August 2004

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

Full work available at URL https://doi.org/10.1142/S0218196703001390

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base
• Word-mappings of level 2
• Equality sets of morphic word sequences
• D0L sequences and their equality sets
• A new bound for the D0L sequence equivalence problem

Cites work

• A short solution for the HDT0L sequence equivalence problem
• A simple proof of the Skolem-Mahler-Lech theorem
• scientific article; zbMATH DE number 3802813 (Why is no real title available?)
• On equality of multiplicity sets of regular languages
• Watson-Crick D0L systems with regular triggers

Cited in

(8)

• 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
• It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base
• Decidability questions related to abstract numeration systems
• Composition of quasi-polynomial maps
• Word-mappings of level 2
• Lindenmayer systems

This page was built for publication: On the Images of ℕ-Rational Sequences Counting Multiplicities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3043616)