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

DOI10.1007/BF00289415zbMATH Open0507.68046OpenAlexW1596197029MaRDI QIDQ1837537FDOQ1837537

Authors: 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Uniform tag sequences
• Title not available (Why is that?)
• Subword complexities of various classes of deterministic developmental languages without interactions
• On nonrepetitive sequences
• Title not available (Why is that?)
• Mots sans carre et morphismes iterés
• The Morse sequence and iterated morphisms

Cited In (8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1837537)