Register

TOC -KLP Mishra

1,237 views
2 votes
2 votes

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

5 votes
5 votes
2 answers
1
PratikLatve asked Oct 8, 2016
13,981 views
KLP Mishra Chapter 5 Excercise question 5.4
Prove the following identity: (a*ab + ba)*a* = (a + ab + ba)* How can we prove this??
Prove the following identity:(a*ab + ba)*a* = (a + ab + ba)*How can we prove this??
User Avatar
1 votes
1 votes
1 answer
3
Sourav_35 asked Jun 9, 2018
820 views
KLP MISHRA
Given {L: every 'a' is followed by "bb"} Design a DFA for LATE(L) and TRUNCATE(L) LATE(L) is obtained by removing the first symbol from L and TRUNCATE(L) is obtained by removing the last symbol from L Eg: If L is 00(0+1)*01 then LATE(L) will be 0(0+1)*01 and TRUNCATE(L) would be 00(0+1)*0
Given {L: every 'a' is followed by "bb"}Design a DFA for LATE(L) and TRUNCATE(L)LATE(L) is obtained by removing the first symbol from L and TRUNCATE(L) is obtained by rem...
User Avatar
0 votes
0 votes
1 answer
4
Sourav_35 asked Mar 15, 2018
2,216 views
THEORY OF COMPUTER SCIENCE BY KLP MISHRA
Construct a DFA such that it accepts all strings over $\{a,b\}$ in which there are at least two occurrences of $b$ between any two occurrences of $a$.
Construct a DFA such that it accepts all strings over $\{a,b\}$ in which there are at least two occurrences of $b$ between any two occurrences of $a$.
User Avatar
Link Copied!