L codes and number systems
From MaRDI portal
Publication:788495
DOI10.1016/0304-3975(83)90111-1zbMath0531.68027OpenAlexW1980791405MaRDI QIDQ788495
Arto Salomaa, Hermann Maurer, Derick Wood
Publication date: 1983
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(83)90111-1
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (11)
On generalized DT0L systems and their fixed points ⋮ Caractérisation results about $L$ codes ⋮ On Lindenmayerian algebraic sequences ⋮ A decision method for the recognizability of sets defined by number systems ⋮ 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 ⋮ Unique representation in number systems and L codes ⋮ Bases and ambiguity of number systems ⋮ On D0L systems with immigration ⋮ SE-SYSTEMS, TIMING MECHANISMS, AND TIME-VARYING CODES
Cites Work
This page was built for publication: L codes and number systems
