Simplifications of homomorphisms

DOI10.1016/S0019-9958(78)90095-5zbMath0387.68062OpenAlexW1967890781MaRDI QIDQ4168093

Andrzej Ehrenfeucht, Grzegorz Rozenberg

Publication date: 1978

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(78)90095-5

Mathematics Subject Classification ID

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

Related Items (18)

Asymptotic behaviour of bi-infinite words ⋮ Caractérisation results about $L$ codes ⋮ A characterization of free pairs of upper triangular free monoid morphisms ⋮ Homomorphisms between multidimensional constant-shape substitutions ⋮ Languages, D0L-systems, sets of curves, and surface automorphisms. ⋮ On the emptiness of the intersection of two DOS languages problem ⋮ Sets of primitive words given by fixed points of mappings ⋮ On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems ⋮ Quasi-deterministic 0L systems and their representation ⋮ Cancellation and periodicity properties of iterated morphisms ⋮ Quasi-deterministic 0L systems ⋮ On the simplification of infinite morphic words ⋮ It is decidable whether or not a permutation-free morphism is an l code ⋮ Repetitiveness of languages generated by morphisms ⋮ On D0L power series ⋮ Systems of equations over a free monoid and Ehrenfeucht's conjecture ⋮ An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet ⋮ Periodicity and ultimate periodicity of D0L systems

This page was built for publication: Simplifications of homomorphisms