MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Consider the ...

Question

$C o n s i d e r t h e f o l l o w i n g N F A M, o v e r t h e a l p h a b e t a . L e t L M b e t h e l a n g u a g e a c c e p t e d b y t h e N F A M . L e t M d e n o t e t h e m a c h i n e o b t a i n e d b y t h e f i n a l a n d n o n f i n a l s t a t e s r e s p e c t i v e l y . T h e n w h i c h o f t h e f o l l o w i n g s t a t e m e n t s i s t r u e a b o u t L M a n d L M ?$

Open in App

Solution

$L (M) = a (a a a) * L (M) = a * C l e a r l y L (M) i s a s u b s e t o f L (M) .$

Suggest Corrections

thumbs-up

0

Similar questions

Q. Let M be a finite automata. Let M' denote the machine obtained by interchanging the final and non final states in the machine M.

I.

L (M) \cup L (M^{'}) = Σ^{*}

L (M) \cap L (M^{'}) = ϕ

What is the validity of the above statements with respect to DFAs and NFAs?

Q. Let M be a finite automata. Let M denote the machine obtained by Interchanging the final and non-final states in the machine M.

I . L (M) \cup L (M^{'}) = \sum^{*}

I I . L (M) \cap L (M^{'}) = ϕ

What is the validity of the above statements with respect to DFA's and NFA's.

Q. Consider the NFAM shown below.

Let the language accepted by M be L. let

L_{1}

be the language accepted by the NFA

M_{1}

, obtained by changing the accpeting state of M to a non-accepting state and by changing the non-accepting state of M to accepting states. Which of the following statements is true?

Q. Let L(R) be the language represented by regular expression R. Let L(G) be the language generated by a context free grammar G. Let L(M) be the language accepted by a Turing machine M.
Which of the following decision problems are undecidable?
I. Given a regular expression R and a string w,is

ω ε

L(R)?
II. Given a context-free grammar G, is L(G)=

ϕ

III. Given a context-free grammar G, is L(G) =

\sum^{*}

for some alphabet

\sum

?
IV. Given a Turing machine M and a string

ω

ω ε

Q. If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet { a, b } will be accepted by the new DFA?

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

States of Matter

Watch in App

Join BYJU'S Learning Program

CrossIcon