Handbook of formal languages, vol. 1
Algebraic and Automata-Theoretic Properties of Formal Languages
Algebraic and Automata-Theoretic Properties of Formal Languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Hi-index | 0.00 |
The concept of density in a free monoid can be generalized from the infix relation to arbitrary relations. Many of the properties known for density can be established over these more general notions of densities. In this paper, we investigate homomorphisms which preserve different types of density. We demonstrate a strict hierarchy between families of homomorphisms which preserve density over different types of relations. However, as with the case of endomorphisms, a similar hierarchy for weak-coding homomorphisms collapses. We also present an algorithm to decide whether a homomorphism preserves density over any relation which satisfies some natural conditions.