Closure properties of recognizable languages, Theory of Computation

We got the class LT by taking the class SL and closing it under Boolean operations. We have observed that LT ⊆ Recog, so certainly any Boolean combination of LT languages will also be recognizable. But what about the class of recognizable languages as a whole? Are Boolean combinations of recognizable (not just LT) languages also recognizable. In answering we can use the same methodology we use to show that any language is recognizable: consider what we need to keep track of in scanning a string in order to determine if it belongs to the language or not and then use that information to build our state set.

Suppose, then, that L = L1 ∩ L2, where L1 and L2 are both recognizable. A string w will be in L iff it is in both L1 and L2. Since they are recognizable there exist DFAs A1 and A2 for which L1 = L(A1) and L2 = L(A2). We can tell if the string is in L1 or L2 simply by keeping track of the state of the corresponding automaton. We can tell if it is in both by keeping track of both states simultaneously.

Posted Date: 3/21/2013 3:06:13 AM | Location : United States







Related Discussions:- Closure properties of recognizable languages, Assignment Help, Ask Question on Closure properties of recognizable languages, Get Answer, Expert's Help, Closure properties of recognizable languages Discussions

Write discussion on Closure properties of recognizable languages
Your posts are moderated
Related Questions
These assumptions hold for addition, for instance. Every instance of addition has a unique solution. Each instance is a pair of numbers and the possible solutions include any third


The Last Stop Boutique is having a five-day sale. Each day, starting on Monday, the price will drop 10% of the previous day’s price. For example, if the original price of a product

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.

This was one of the ?rst substantial theorems of Formal Language Theory. It's maybe not too surprising to us, as we have already seen a similar equivalence between LTO and SF. But

Let G be a graph with n > 2 vertices with (n2 - 3n + 4)/2 edges. Prove that G is connected.

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

how to find whether the language is cfl or not?


matlab v matlab