Register

Regular language

• edited by
641 views

2 Answers

0 0 votes
If you have the knowledge of regular expression you can already look that all three languages are same and produce all the strings means Sigma*,now come to the FA start verifying from very first string epsilon ,then a ,then b you will find that all the strings you can get from the machine. For example I am taking a string 'aba' a will come first by the loop at state 1 then by using epsilon we can move to 2nd state where we will get b then by using epsilon we will come again to 1st state from where will again get a and by using epsilon we can go to final and hence our string got accepted.
Voting & Accepting an answer helps improve the community
← Previous · IIT BHUBANESHWAR MTE...Next → · Consider the followi...
← Previous in category · #unacademyDPPNext in category → · #TOC regular express...
Position:
Show:

Related questions

0 0 votes
1 1 answer
66
66 views
GO Classes asked 5 days ago
66 views
GO Classes DPP | GATE CS | Theory of Computation | Regular-Language Non-Emptiness
Which of the following is true?There is no known algorithm for checking whether a regular language is nonempty. The proof of the pumping lemma was a proof by induction. T...
2 2 votes
1 1 answer
91
91 views
GO Classes asked Sep 21
91 views
GO Classes DPP | GATE CS | Theory of Computation | Regular Language
Let $M$ and $N$ be two DFAs. Define$$Z=\{u_1v_1u_2v_2\cdots u_kv_k : k\ge0, ~u_i\in L(M), ~v_i\in L(N)\}.$$Which regular-language expression describes $Z$?$L(M)^*L(N)^*$ ...
0 0 votes
1 1 answer
73
73 views
GO Classes asked Sep 21
73 views
GO Classes DPP | GATE CS | Theory of Computation | Regular Language
For an arbitrary language $L$, which of the following statements is correct?If $L^*$ is regular, then $L$ must be regular. If $L$ is nonregular, then $L^*$ must be nonreg...
1 1 vote
1 1 answer
82
82 views
GO Classes asked Sep 16
82 views
GO Classes DPP | GATE CS | Theory of Computation | Regular Language
Let $L=\{w\in{0,1}^*\mid w$ contains equal numbers of substrings $01$ and $10\}$. Which statements are correct?$L$ is regular. A correct regular expression for $L$ is $\e...