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:
“Happy or unhappy, families are all mysterious. We have only to imagine how differently we would be described—and will be, after our deaths—by each of the family members who believe they know us.”
—Gloria Steinem (b. 1934)
“People in places many of us never heard of, whose names we can’t pronounce or even spell, are speaking up for themselves. They speak in languages we once classified as “exotic” but whose mastery is now essential for our diplomats and businessmen. But what they say is very much the same the world over. They want a decent standard of living. They want human dignity and a voice in their own futures. They want their children to grow up strong and healthy and free.”
—Hubert H. Humphrey (1911–1978)