Homomorphisms and E-free Homomorphisms in Formal Language Theory
Homomorphisms are also used in the study of formal languages (although within this context, often they are briefly referred to as morphisms). Given alphabets and, a function h : → such that for all u and v in is called a homomorphism (or simply morphism) on . Let e denote the empty word. If h is a homomorphism on and for all in, then h is called an e-free homomorphism.
This type of homomorphism can be thought of as (and is equivalent to) a monoid homomorphism where the set of all words over a finite alphabet is a monoid (in fact it is the free monoid on ) with operation concatenation and the empty word as the identity.
Read more about this topic: Homomorphism
Famous quotes containing the words formal, language and/or theory:
“The formal Washington dinner party has all the spontaneity of a Japanese imperial funeral.”
—Simon Hoggart (b. 1946)
“When you’re lying awake with a dismal headache, and repose is
taboo’d by anxiety,
I conceive you may use any language you choose to indulge in without impropriety;”
—Sir William Schwenck Gilbert (1836–1911)
“The great tragedy of science—the slaying of a beautiful theory by an ugly fact.”
—Thomas Henry Huxley (1825–1895)