Fixed languages and the adult languages of ol schemest†

DOI10.1080/00207168108803273zbMath0472.68034OpenAlexW2067367073MaRDI QIDQ3925885

Tom Head

Publication date: 1981

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168108803273

zbMATH Keywords

Lindenmayer systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (21)

Fixed points of endomorphisms of certain free products ⋮ An algorithmic approach to the problem of a semiretract base ⋮ The Billaud conjecture for \(|\varSigma| = 4\), and beyond ⋮ Complexity of testing morphic primitivity ⋮ Discontinuities in pattern inference ⋮ Periodicity Problem of Substitutions over Ternary Alphabets ⋮ Linear-time version of Holub's algorithm for morphic imprimitivity testing ⋮ Unambiguous erasing morphisms in free monoids ⋮ The unambiguity of segmented morphisms ⋮ Restricted ambiguity of erasing morphisms ⋮ On a conjecture about finite fixed points of morphisms ⋮ Some remarks about stabilizers ⋮ Unambiguous Erasing Morphisms in Free Monoids ⋮ On two-sided infinite fixed points of morphisms ⋮ On Billaud words and their companions ⋮ Retractions and retracts of free topological monoids ⋮ On Billaud words and their companions ⋮ Morphically primitive words ⋮ UNAMBIGUOUS MORPHIC IMAGES OF STRINGS ⋮ Polynomial-time algorithm for fixed points of nontrivial morphisms ⋮ Expanded subalphabets in the theories of languages and semigroups†

Cites Work

• Unnamed Item
• On the fixpoints of monogenic functions in free monoids
• Hypercodes

This page was built for publication: Fixed languages and the adult languages of ol schemest^†