Theorem The class of recognizable languages is closed under Boolean operations.

The construction of the proof of Lemma 3 gives us a DFA that keeps track of whether or not a given string is in either or both of any pair of recognizable languages. We can modify the construction for other Boolean operations simply by selecting the appropriate set of accepting states:

• Union: Let F′

= {(q, p) | q ∈ F₁ or p ∈ F₂}. Then L(A′ ) = L₁ ∪ L₂.

• Relative complement: Let F′ = F1 × (Q₂ - F₂). Then L(A′ ) = L₁ -L₂.

• Complement: Let L1 = Σ* and use the construction for relative complement.

Posted Date: 3/21/2013 3:15:49 AM | Location : United States

Ask an Expert

Related Discussions:- Boolean operations - class of recognizable languages, Assignment Help, Ask Question on Boolean operations - class of recognizable languages, Get Answer, Expert's Help, Boolean operations - class of recognizable languages Discussions

Write discussion on Boolean operations - class of recognizable languages
Your posts are moderated

Write your message here..

Related Questions

Nfas with e-transitions, We now add an additional degree of non-determinism... We now add an additional degree of non-determinism and allow transitions that can be taken independent of the input-ε-transitions. Here whenever the automaton is in state 1

Regular expressions, The project 2 involves completing and modifying the C+... The project 2 involves completing and modifying the C++ program that evaluates statements of an expression language contained in the Expression Interpreter that interprets fully pa

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

Theory of computation, Computations are deliberate for processing informati... Computations are deliberate for processing information. Computability theory was discovered in the 1930s, and extended in the 1950s and 1960s. Its basic ideas have become part of

Decision problems of regular languages, We'll close our consideration of re... We'll close our consideration of regular languages by looking at whether (certain) problems about regular languages are algorithmically decidable.

Perfect induction, A.(A+C)=A A.(A+C)=A

Pumping lema, wht is pumping lema wht is pumping lema

Grammer, write grammer to produce all mathematical expressions in c. write grammer to produce all mathematical expressions in c.

Project, can you plz help with some project ideas relatede to DFA or NFA or... can you plz help with some project ideas relatede to DFA or NFA or anything

Agents architecture, Describe the architecture of interface agency Describe the architecture of interface agency