Simplifications of homomorphisms

DOI10.1016/S0019-9958(78)90095-5MaRDI QIDQ4168093zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(20)

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

This page was built for publication: Simplifications of homomorphisms

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