Abstract Family of Languages - Formal Definitions

Formal Definitions

A formal language is a set for which there exists a finite set of abstract symbols such that, where * is the Kleene star operation.

A family of languages is an ordered pair, where

  1. is an infinite set of symbols;
  2. is a set of formal languages;
  3. For each in there exists a finite subset ⊂ such that ⊆ ; and
  4. ≠ Ø for some in .

A trio is a family of languages closed under e-free homomorphism, inverse homomorphism, and intersection with regular language.

A full trio, also called a cone, is a trio closed under arbitrary homomorphism.

A (full) semi-AFL is a (full) trio closed under union.

A (full) AFL is a (full) semi-AFL closed under concatenation and the Kleene plus.

Read more about this topic:  Abstract Family Of Languages

Famous quotes containing the words formal and/or definitions:

    The conviction that the best way to prepare children for a harsh, rapidly changing world is to introduce formal instruction at an early age is wrong. There is simply no evidence to support it, and considerable evidence against it. Starting children early academically has not worked in the past and is not working now.
    David Elkind (20th century)

    What I do not like about our definitions of genius is that there is in them nothing of the day of judgment, nothing of resounding through eternity and nothing of the footsteps of the Almighty.
    —G.C. (Georg Christoph)