Expanded subalphabets in the theories of languages and semigroups†

DOI10.1080/00207168208803330zbMath0496.68050OpenAlexW2076747746MaRDI QIDQ3960136

Tom Head

Publication date: 1982

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

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

zbMATH Keywords

codesL-systemsretractsadult languagesprojective monoidsfixed languagesstationary languages

Mathematics Subject Classification ID

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

Related Items (12)

Semiretracts of a free monoid ⋮ Retracts of free monoids are nowhere dense with respect to finite group topologies and p-adic topologies ⋮ An algorithmic approach to the problem of a semiretract base ⋮ Asymptotic behaviour of bi-infinite words ⋮ On the family of retracts of free monoids ⋮ The poset of retracts of a free monoid ⋮ The lattice of semiretracts of a free monoid ⋮ Semiretracts -- a counterexample and some results. ⋮ On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems ⋮ Retractions and retracts of free topological monoids ⋮ The intersection of retracts of \(A^{*}\) ⋮ Periodicity and ultimate periodicity of D0L systems

Cites Work

• Unnamed Item
• Unnamed Item
• On the fixpoints of monogenic functions in free monoids
• A mode of decomposition of regular languages
• Equality languages and fixed point languages
• Context-free and stationary languagest†
• Fixed languages and the adult languages of ol schemest^†
• Context free languages in biological systems
• Hypercodes

This page was built for publication: Expanded subalphabets in the theories of languages and semigroups†