Pre-measure

In formal language theory, a cone is a set of formal languages that has some desirable closure properties enjoyed by some well-known sets of languages, in particular by the families of regular languages, context-free languages and the recursively enumerable languages. The concept of a cone is a more abstract notion that subsumes all of these families. A similar notion is the faithful cone, having somewhat relaxed conditions. For example, the context-sensitive languages do not form a cone, but still have the required properties to form a faithful cone.

The terminology cone has a French origin. In the American oriented literature one usually speaks of a full trio. The trio corresponds to the faithful cone.

Definition

A cone is a non-empty family $\mathcal{𝒮}$ of languages such that, for any $L\in \mathcal{𝒮}$ over some alphabet $\mathrm{\Sigma }$,

• if $h$ is a homomorphism from ${\mathrm{\Sigma }}^{\ast }$ to some ${\mathrm{\Delta }}^{\ast }$, the language $h(L)$ is in $\mathcal{𝒮}$;
• if $h$ is a homomorphism from some ${\mathrm{\Delta }}^{\ast }$ to ${\mathrm{\Sigma }}^{\ast }$, the language $h^{-1}(L)$ is in $\mathcal{𝒮}$;
• if $R$ is any regular language over $\mathrm{\Sigma }$, then $L\cap R$ is in $\mathcal{𝒮}$.

The family of all regular languages is contained in any cone.

If one restricts the definition to homomorphisms that do not introduce the empty word $\lambda$ then one speaks of a faithful cone; the inverse homomorphisms are not restricted. Within the Chomsky hierarchy, the regular languages, the context-free languages, and the recursively enumerable languages are all cones, whereas the context-sensitive languages and the recursive languages are only faithful cones.

Relation to Transducers

A finite state transducer is a finite state automaton that has both input and output. It defines a transduction $T$, mapping a language $L$ over the input alphabet into another language $T(L)$ over the output alphabet. Each of the cone operations (homomorphism, inverse homomorphism, intersection with a regular language) can be implemented using a finite state transducer. And, since finite state transducers are closed under composition, every sequence of cone operations can be performed by a finite state transducer.

Conversely, every finite state transduction $T$ can be decomposed into cone operations. In fact, there exists a normal form for this decomposition, which is commonly known as Nivat's Theorem: Namely, each such $T$ can be effectively decomposed as $T(L)=g(h^{-1}(L)\cap R)$, where $g,h$ are homomorphisms, and $R$ is a regular language depending only on $T$.

Altogether, this means that a family of languages is a cone if it is closed under finite state transductions. This is a very powerful set of operations. For instance one easily writes a (nondeterministic) finite state transducer with alphabet $\{a,b\}$ that removes every second $b$ in words of even length (and does not change words otherwise). Since the context-free languages form a cone, they are closed under this exotic operation.

See also

• Abstract family of languages

Notes

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

References

• 55 years old Systems Administrator Antony from Clarence Creek, really loves learning, PC Software and aerobics. Likes to travel and was inspired after making a journey to Historic Ensemble of the Potala Palace.
  
  You can view that web-site... ccleaner free download

• Template:Cite doi

• Seymour Ginsburg, Algebraic and automata theoretic properties of formal languages, North-Holland, 1975, ISBN 0-7204-2506-9.

• John E. Hopcroft and Jeffrey D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley Publishing, Reading Massachusetts, 1979. ISBN 0-201-02988-X. Chapter 11: Closure properties of families of languages.

• 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
  
  My blog: http://www.primaboinca.com/view_profile.php?userid=5889534

External links

• Encyclopedia of mathematics: Trio, Springer.