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
Intuitively, closure of SL 2 under intersection is reasonably easy to see, particularly if one considers the Myhill graphs of the automata. Any path through both graphs will be a

What is the purpose of GDTR?

s->0A0|1B1|BB A->C B->S|A C->S|null find useless symbol?

i have some questions in automata, can you please help me in solving in these questions?

What are the benefits of using work breakdown structure, Project Management

The fundamental idea of strictly local languages is that they are speci?ed solely in terms of the blocks of consecutive symbols that occur in a word. We'll start by considering lan

shell script to print table in given range

The Equivalence Problem is the question of whether two languages are equal (in the sense of being the same set of strings). An instance is a pair of ?nite speci?cations of regular

LTO was the closure of LT under concatenation and Boolean operations which turned out to be identical to SF, the closure of the ?nite languages under union, concatenation and compl

Find the Regular Grammar for the following Regular Expression: a(a+b)*(ab*+ba*)b.