Equality Languages

The equality language of the homomorphisms g,h: Σ* → Δ* is the set of all words from Σ* on which homomorphisms g and h agree. It is denoted by Eq(g,h) and more precisely defined as:

Eq(g,h)={w : g(w)=h(w)}.

The simplest non-trivial class of equality languages are binary equality languages, that is the equality languages of binary homomorphisms. Even though binary equality languages are the simplest non-trivial equality languages, their precise structure is still unknown.

-- JanaHadravova - 22 May 2012
Topic revision: r3 - 2012-05-30 - JeffreyShallit
 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2017 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback