Register

TOC-Minimal FA

928 views
1 votes
1 votes

User Avatar

1 Answer

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

Related questions

3 votes
3 votes
1 answer
1
rahul sharma 5 asked Aug 4, 2017
1,314 views
Number of Final states in minimal FA(NFA)
What will be total number of final states in NFA for the given regular expression? $R=(a+b)^{*}b(a+b+\epsilon )$
What will be total number of final states in NFA for the given regular expression?$R=(a+b)^{*}b(a+b+\epsilon )$
User Avatar
5 votes
5 votes
2 answers
3
pC asked Jan 2, 2016
2,697 views
How to construct compound Automata ? and find the no of states in minimal FA ?
Construct Minimal FA that accept all binary strings ends with 01 AND length of string is EVEN . Also find no of states in its minimal FA
Construct Minimal FA that accept all binary strings ends with 01 AND length of string is EVEN .Also find no of states in its minimal FA
User Avatar
0 votes
0 votes
1 answer
4
Ashish Roy 1 asked Jul 15, 2018
1,135 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*)^6 d) (b*ab*ab*ab*ab*ab*ab*)* Please do explain also.
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...
User Avatar
Link Copied!