THE BASE PROBLEM FOR D0L PARIKH SETS

DOI10.1142/S0129054106003929zbMath1093.68053MaRDI QIDQ5291307

Juha Honkala

Publication date: 10 May 2006

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Presburgerness of predicates regular in two number systems
• Numeration systems, linear recurrences, and regular sets
• The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet
• It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base
• Thin and slender languages

This page was built for publication: THE BASE PROBLEM FOR D0L PARIKH SETS