785 views
1 votes
1 votes

Build an DFA that accepts a and b as an input and contain words that does not begin and end with double letters.

Please log in or register to answer this question.

Related questions

1 votes
1 votes
0 answers
1
hashir inayat asked Jul 17, 2017
952 views
Suppose a particular FA, called FIN, has the property that it had only one final state that was not the start state. During the night, vandals come and switch the + sign ...
0 votes
0 votes
1 answer
2
nida nadeem asked Feb 28, 2017
1,440 views
build an fa that accepts language of all strings of length 4 or more such that next to last (second last) letter is equal to the second letter of input string
1 votes
1 votes
0 answers
3
hashir inayat asked Jul 23, 2017
279 views
Convert regular expression to dfa(i) (ab*)*(ii) (a+ab)*(a+^)
4 votes
4 votes
0 answers
4
Bikram asked Aug 12, 2017
605 views
The number of possible finite automata with two states $a0$ and $a1$ (where $a0$ is always the initial state over the alphabet $\{p, q\}$) which accepts empty language is...