Recurrent words for substitution

DOI10.1007/BF01744441MaRDI QIDQ3763604zbMATH OpenOpenAlexFDO

Authors Jacques Sakarovitch, Taishin Yasunobu Nishida, Youichi Kobuchi

Publication date 1984

Published in Mathematical Systems Theory (Search for Journal in Brave)

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

zbMATH Keywords

context-free languagerecurrent wordsregular language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Repeatable words for substitution
• RECURRENT DOUBLE SEQUENCES THAT CAN BE PRODUCED BY CONTEXT-FREE SUBSTITUTIONS
• Power of words and recognizability of fixpoints of a substitution
• Recurrent partial words
• scientific article; zbMATH DE number 3943055

Cites work

• A modification of a substitution theorem and some necessary and sufficient conditions for sets to be context-free
• Context free languages in biological systems
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• Stability in OL systems
• Stability of desynchronized 0L-systems

Cited in

(6)

• Repeatable words for substitution
• Power of words and recognizability of fixpoints of a substitution
• Stability in OL systems
• On uniform recurrence of a direct product
• On equality between fuzzy context-free and fuzzy adult 0L languages
• Stability of desynchronized 0L-systems

This page was built for publication: Recurrent words for substitution

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