On D0L systems with immigration

DOI10.1016/0304-3975(93)90289-6zbMath0801.68104OpenAlexW2068597709MaRDI QIDQ1314370

Juha Honkala

Publication date: 29 November 1994

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

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90289-6

zbMATH Keywords

regularityimmigrationdecidabilitysubword complexityD0L systemsdegrees of ambiguity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

On generalized DT0L systems and their fixed points

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• L codes and number systems
• Unique representation in number systems and L codes
• Bases and ambiguity of number systems
• The equivalence of finite valued transducers (on HDT0L languages) is decidable
• Bounded delay L codes
• Subword complexities of various classes of deterministic developmental languages without interactions
• La finitude des représentations linéaires des semi-groupes est decidable
• Ambiguity and decision problems concerning number systems
• On the periodicity of morphisms on free monoids
• The ω sequence problem for DOL systems is decidable
• A decision method for the recognizability of sets defined by number systems
• On number systems with negative digits
• Caractérisation results about $L$ codes
• Decidability of periodicity for infinite words
• It is decidable whether or not a permutation-free morphism is an l code

This page was built for publication: On D0L systems with immigration