The signature of rational languages

DOI10.1016/J.TCS.2016.04.023zbMath1355.68165OpenAlexW2345562577MaRDI QIDQ728282

Jacques Sakarovitch, Victor Marsault

Publication date: 19 December 2016

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.023

zbMATH Keywords

finite automatamorphic wordsrational languagesabstract numeration systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Other number representations (11A67)

Related Items (4)

Automatic sequences: from rational bases to trees ⋮ The carry propagation of the successor function ⋮ From Combinatorial Games to Shape-Symmetric Morphisms ⋮ Some combinatorics from Zeckendorf representations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representing real numbers in a generalized numeration system
• Odometers on regular languages
• Powers of rationals modulo 1 and rational base number systems
• Systèmes de numération et fonctions fractales relatifs aux substitutions. (Numeration systems and fractal functions related to substitutions)
• Digital sum problems and substitutions on a finite alphabet
• Trees and Languages with Periodic Signature
• Breadth-First Serialisation of Trees and Rational Languages
• Digital sum moments and substitutions
• Surminimisation of Automata
• Automatic Sequences
• Formal Languages, Automata and Numeration Systems 2
• Number representation and finite automata
• Abstract numeration systems
• Analysis of digital functions and applications
• The equality problem for purely substitutive words
• On the base-dependence of sets of numbers recognizable by finite automata
• Uniform tag sequences
• Numeration systems on a regular language

This page was built for publication: The signature of rational languages