Bases and ambiguity of number systems
From MaRDI portal
Publication:798009
DOI10.1016/0304-3975(84)90126-9zbMath0546.68066OpenAlexW1973057672MaRDI QIDQ798009
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(84)90126-9
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Radix representation; digital problems (11A63)
Related Items
Linear numeration systems of order two, Caractérisation results about $L$ codes, On Lindenmayerian algebraic sequences, A decision method for the recognizability of sets defined by number systems, From Combinatorial Games to Shape-Symmetric Morphisms, Bounded delay L codes, On number systems with finite degree of ambiguity, It is decidable whether or not a permutation-free morphism is an l code, On D0L systems with immigration
Cites Work