Kleenes theorem, Theory of Computation

All that distinguishes the de?nition of the class of Regular languages from that of the class of Star-Free languages is that the former is closed under Kleene closure while the latter is closed only under complement. Since the Star-Free languages are exactly the LTO languages which are a subclass of the Recognizable languages and the class of Recognizable languages is closed under union, concatenation and Kleene closure, it follows that every Regular language is Recognizable.

Posted Date: 3/21/2013 1:20:16 AM | Location : United States







Related Discussions:- Kleenes theorem, Assignment Help, Ask Question on Kleenes theorem, Get Answer, Expert's Help, Kleenes theorem Discussions

Write discussion on Kleenes theorem
Your posts are moderated
Related Questions


what problems are tackled under numerical integration

proof ogdens lemma .with example i am not able to undestand the meaning of distinguished position .

Another way of interpreting a strictly local automaton is as a generator: a mechanism for building strings which is restricted to building all and only the automaton as an inexh

So we have that every language that can be constructed from SL languages using Boolean operations and concatenation (that is, every language in LTO) is recognizable but there are r

Exercise:  Give a construction that converts a strictly 2-local automaton for a language L into one that recognizes the language L r . Justify the correctness of your construction.

A Turing machine is a theoretical computing machine made-up by Alan Turing (1937) to serve as an idealized model for mathematical calculation. A Turing machine having of a line of

Find a regular expression for the regular language L={w | w is decimal notation for an integer that is a multiple of 4}

The SL 2 languages are speci?ed with a set of 2-factors in Σ 2 (plus some factors in {?}Σ and some factors in Σ{?} distinguishing symbols that may occur at the beginning and en