Recent questions tagged finite-automata

0 votes
0 answers
91
0 votes
1 answer
92
0 votes
1 answer
93
What will be the regular expression for following fa using recurrence relation method.
2 votes
3 answers
94
0 votes
1 answer
95
0 votes
2 answers
99
Example: 11110100000111 should be accepted. There are 6 zeros. 6 is divisble by 2 and 3. This machine required at least six states.