Some Families of Languages
The following are some simple results from the study of abstract families of languages.
Within the Chomsky hierarchy, the regular languages, the context-free languages, and the recursively enumerable languages are all full AFLs. However, the context sensitive languages and the recursive languages are AFLs, but not full AFLs because they are not closed under arbitrary homomorphisms.
The family of regular languages are contained within any cone (full trio). Other categories of abstract families are identifiable by closure under other operations such as shuffle, reversal, or substitution.
Read more about this topic: Abstract Family Of Languages
Famous quotes containing the words families and/or languages:
“Families have always been in flux and often in crisis; they have never lived up to nostalgic notions about “the way things used to be.” But that doesn’t mean the malaise and anxiety people feel about modern families are delusions, that everything would be fine if we would only realize that the past was not all it’s cracked up to be. . . . Even if things were not always right in families of the past, it seems clear that some things have newly gone wrong.”
—Stephanie Coontz (20th century)
“It is time for dead languages to be quiet.”
—Natalie Clifford Barney (1876–1972)