Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series

DOI10.1016/S0304-3975(01)00184-0zbMath0983.68101OpenAlexW1994728128MaRDI QIDQ5958624

Michel Rigo

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00184-0

zbMATH Keywords

ComplexityArithmetic operationsNumeration systemRational seriesRecognizability

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Decidability questions related to abstract numeration systems ⋮ Real numbers having ultimately periodic representations in abstract numeration systems ⋮ On extended boundary sequences of morphic and Sturmian words ⋮ A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS ⋮ Regular sequences and synchronized sequences in abstract numeration systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Cobham-Semenov theorem
• Logic and \(p\)-recognizable sets of integers
• Numeration systems, linear recurrences, and regular sets
• Greedy numeration systems and regularity
• Bertrand numeration systems and recognizability
• Generalization of automatic sequences for numeration systems on a regular language
• Construction of regular languages and recognizability of polynomials
• \(\beta\)-shift, numeration systems, and automata
• Ranking and formal power series
• Systems of Numeration
• Representations of numbers and finite automata
• Rational transductions and complexity of counting problems
• Characterizing regular languages with polynomial densities
• On the base-dependence of sets of numbers recognizable by finite automata
• Numeration systems on a regular language

This page was built for publication: Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series