Formal Languages, Automata and Numeration Systems 1
From MaRDI portal
Recommendations
- Formal languages, automata and numeration systems. Vol. 2. Applications to recognizability and decidability
- Abstract numeration systems
- The signature of rational languages
- Preliminaries [to: Combinatorics, words and symbolic dynamics]
- Generalization of automatic sequences for numeration systems on a regular language
- scientific article; zbMATH DE number 1737190
- scientific article; zbMATH DE number 2210765
- Abstract numeration systems on bounded languages and multiplication by a constant
- General framework
- Real numbers having ultimately periodic representations in abstract numeration systems
Cited in
(25)- A generalization of automatic sequences
- Convergence of Pascal-like triangles in Parry-Bertrand numeration systems
- The polynomial endomorphisms of graph algebras
- Spectral theory of regular sequences
- The carry propagation of the successor function
- A simple approach to minimal substitution subshifts
- Asymptotic properties of free monoid morphisms
- Sur des points fixes de morphismes d'un monoïde libre
- Numeration systems: a link between number theory and formal language theory
- scientific article; zbMATH DE number 1552120 (Why is no real title available?)
- The formal inverse of the period-doubling sequence
- General framework
- Preliminaries [to: Combinatorics, words and symbolic dynamics]
- scientific article; zbMATH DE number 2156418 (Why is no real title available?)
- Hidden automatic sequences
- Relations on words
- From combinatorial games to shape-symmetric morphisms
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- Abelian combinatorics on words: a survey
- Factor and arithmetic complexity of concatenating the \(n!\)
- Some results on digital segments and balanced words
- Generalized natural density \(DF(\mathfrak{F}_k)\) of Fibonacci word
- Irregularity and topological indices in Fibonacci word trees and modified Fibonacci word index
- Characterizing morphic sequences
- Morphisms and BWT-run sensitivity
This page was built for publication: Formal Languages, Automata and Numeration Systems 1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936963)