Trees and languages with periodic signature
From MaRDI portal
Publication:505064
DOI10.1016/J.INDAG.2016.11.015zbMATH Open1429.68128OpenAlexW2559958805MaRDI QIDQ505064FDOQ505064
Authors: Victor Marsault, Jacques Sakarovitch 
Publication date: 18 January 2017
Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.indag.2016.11.015
Recommendations
Formal languages and automata (68Q45) Trees (05C05) Radix representation; digital problems (11A63) Combinatorics on words (68R15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorics on Words
- Powers of rationals modulo 1 and rational base number systems
- Number representation and finite automata
- One counter languages and the IRS condition
- Trees and languages with periodic signature
- Approximating the Fibonacci sequence
- On sets of numbers rationally represented in a rational base number system
- Rational base number systems for \(p\)-adic numbers
- Abstract numeration systems
- Numeration systems on a regular language
Cited In (10)
- Title not available (Why is that?)
- Automatic sequences: from rational bases to trees
- The signature of rational languages
- From combinatorial games to shape-symmetric morphisms
- Breadth-first serialisation of trees and rational languages (short paper)
- Title not available (Why is that?)
- Revisiting regular sequences in light of rational base numeration systems
- On subtrees of the representation tree in rational base numeration systems
- The carry propagation of the successor function
- Trees and languages with periodic signature
This page was built for publication: Trees and languages with periodic signature
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505064)
