Repeatable words for substitution

DOI10.1016/0304-3975(87)90072-7MaRDI QIDQ1102122zbMATH OpenOpenAlexFDO

Authors Youichi Kobuchi, Taishin Yasunobu Nishida

Publication date 1987

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

Full work available at URL https://doi.org/10.1016/0304-3975(87)90072-7

zbMATH Keywords

context-free languagerepeatable languagerepeatable wordssubstitution system

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Recurrent words for substitution
• Power of words and recognizability of fixpoints of a substitution
• RECURRENT DOUBLE SEQUENCES THAT CAN BE PRODUCED BY CONTEXT-FREE SUBSTITUTIONS
• Invariant sets for substitution
• A characterization of substitutive sequences using return words

Cites work

• Context free languages in biological systems
• Context-free and stationary languagest†
• DOL schemes and the periodicity of string embeddings
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• Recurrent words for substitution
• Stability in L systems
• Stability in OL systems

Cited in

(9)

• On infinite words obtained by selective substitution grammars
• Power of words and recognizability of fixpoints of a substitution
• Invariant sets for substitution
• Recurrent words for substitution
• scientific article; zbMATH DE number 1333611 (Why is no real title available?)
• scientific article; zbMATH DE number 512831 (Why is no real title available?)
• scientific article; zbMATH DE number 919839 (Why is no real title available?)
• Quasi-deterministic 0L systems
• Quasi-deterministic 0L systems and their representation

This page was built for publication: Repeatable words for substitution

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