Recurrent words for substitution

DOI10.1007/BF01744441zbMath0627.68065OpenAlexW2038132579MaRDI QIDQ3763604

Youichi Kobuchi, Taishin Y. Nishida, Jacques Sakarovitch

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 languageregular languagerecurrent words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Repeatable words for substitution ⋮ On equality between fuzzy context-free and fuzzy adult 0L languages ⋮ Stability of desynchronized 0L-systems

Cites Work

• Unnamed Item
• Stability of desynchronized 0L-systems
• Stability in OL systems
• Context free languages in biological systems
• A modification of a substitution theorem and some necessary and sufficient conditions for sets to be context-free

This page was built for publication: Recurrent words for substitution