2,385 views

1 Answer

Related questions

5 votes
5 votes
2 answers
2
dragonball asked Oct 26, 2017
702 views
Draw a minimal DFA which accepts a language L over {a,b}01 [ ((10) * + 111) * + 0 ] * 1
4 votes
4 votes
1 answer
4
Aakanchha asked May 22, 2015
5,091 views
Build an FA that accepts the language of all strings of a's and b's such that next-to-last letter is an $a$.