275 views

1 Answer

Related questions

0 votes
0 votes
1 answer
1
Jeevesh asked Nov 12, 2018
1,007 views
What should be the approach to draw the DFA - "All strings that have exactly one double letter in them" on symbols {a,b}.
1 votes
1 votes
1 answer
2
The Capricorn asked Mar 5, 2018
318 views
Give Regular Expression for Language of all those strings which do not contain the substring ‘bb’. Also draw its DFA.
1 votes
1 votes
1 answer
3
The Capricorn asked Mar 5, 2018
261 views
Give Regular Expression for the Language of all those strings which end with ‘aa’ or ‘ab’ and have odd length. Also, draw its DFA.
0 votes
0 votes
0 answers
4
The Capricorn asked Feb 25, 2018
408 views
build an FA such that when the labels a and b are swapped the new machine is different from the old one but equivalent (the language defined by these machines is the same...