859 views
0 votes
0 votes
construct the minimul FA, that accepts all the string of 0's and 1's

A)The second symbol from the right end of the string is 0

B)The third symbol from the right end of the string is 1

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
2
suraj patel asked Jul 10, 2018
2,510 views
Construct the Minimum FA that accepts all the string of 0's and 1's whereA)Every String start and end with Zero.B)Every string Start and end with Same Symbol.
0 votes
0 votes
1 answer
4
Mizuki asked Nov 14, 2018
1,048 views
When we convert a (minimal) NFA to DFA by subset construction method, is the DFA obtained always a minimal DFA?Please elaborate.