Closure properties of recognizable languages, Theory of Computation

Assignment Help:

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.


Related Discussions:- Closure properties of recognizable languages

Automaton for finite languages, We can then specify any language in the cla...

We can then specify any language in the class of languages by specifying a particular automaton in the class of automata. We do that by specifying values for the parameters of the

Problem solving and programming concepts, The Last Stop Boutique is having ...

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

Turing machine, design a turing machine that accepts the language which con...

design a turing machine that accepts the language which consists of even number of zero''s and even number of one''s?

Automata, automata of atm machine

automata of atm machine

Bonds, . On July 1, 2010, Harris Co. issued 6,000 bonds at $1,000 each. The...

. On July 1, 2010, Harris Co. issued 6,000 bonds at $1,000 each. The bonds paid interest semiannually at 5%. The bonds had a term of 20 years. At the time of issuance, the market r

Gdtr, What is the purpose of GDTR?

What is the purpose of GDTR?

Automaton theory, let G=(V,T,S,P) where V={a,b,A,B,S}, T={a,b},S the start ...

let G=(V,T,S,P) where V={a,b,A,B,S}, T={a,b},S the start symbol and P={S->Aba, A->BB, B->ab,AB->b} 1.show the derivation sentence for the string ababba 2. find a sentential form

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd