Hierarchie et fermeture de certaines classes de tag-systèmes

DOI10.1007/BF00289415zbMath0507.68046OpenAlexW1596197029MaRDI QIDQ1837537

Jean-Jacques Pansiot

Publication date: 1983

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289415

zbMATH Keywords

closure propertiesfull inclusion graphsets of infinite wordstag-systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Asymptotic properties of free monoid morphisms ⋮ Uniform tag systems for paperfolding sequences ⋮ A generalization of automatic sequences ⋮ Decidable problems in substitution shifts ⋮ General Framework ⋮ Look and Say Fibonacci ⋮ On the simplification of infinite morphic words ⋮ A generalization of automatic sequences

Cites Work

• Mots sans carre et morphismes iterés
• The Morse sequence and iterated morphisms
• Subword complexities of various classes of deterministic developmental languages without interactions
• On nonrepetitive sequences
• Uniform tag sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hierarchie et fermeture de certaines classes de tag-systèmes