Register

GATE - TOC Regular Languages and FA

• retagged by
288 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · SwitchNext → · programming question...
← Previous in category · Countable uncountabl...Next in category → · GATE - TOC Regular L...
Position:
Show:

Related questions

0 0 votes
1 1 answer
1.6k
1.6k views
Ashish Roy 1 asked Jul 15, 2018
1,583 views
GATE - TOC Regular Languages & FA
Let L(r1)=(b*ab*ab*ab*)* & L(r2)=(b*ab*ab*)*. What is L(r1) Intersection L(r2)?a) (b*ab*ab*ab*)*b) (b*ab*ab*)*c) (b*ab*ab*)^6d) (b*ab*ab*ab*ab*ab*ab*)*Please do explain a...
0 0 votes
1 answers 1 answer
946
946 views
srishtipandey420 asked Jul 5, 2024
946 views
fa and regular languages
Hello! the answer to above question is option b , however, according to me, the complemented machine can also accept option c because after going to the non-final (middle...
0 0 votes
2 answers 2 answers
2.8k
2.8k views
Abhipsa asked Jan 21, 2019
2,820 views
Regular Languages
Is this language regular? If yes, how?L = {wxwR | x, w ϵ {0, 1}*}wR is reverse of string w. Thank you!
0 0 votes
2 2 answers
1.7k
1.7k views
sripo asked Jan 1, 2019
1,665 views
MadeEasy Subject Test 2019: Theory Of Computation - Regular Languages
Can anyone explain how S2 is false,I did not understand their logic.