3,556 views

1 Answer

Best answer
4 votes
4 votes

Start & Final State =q0

selected by

Related questions

0 votes
0 votes
1 answer
1
jayadev asked Jan 7, 2022
796 views
follow method first draw dfa for ‘a’ always followed by ‘bb’ and reverse it
0 votes
0 votes
2 answers
2
Sambhrant Maurya asked Sep 27, 2018
4,490 views
Construct a DFA over Σ=(a,b) so that it accepts all strings where 1) 2nd symbol from the right is 'a'2) 3rd symbol from the right is 'a'
2 votes
2 votes
2 answers
3
set2018 asked Sep 21, 2017
1,321 views
Let L1 and L2 be the languagesL1 = {x ∈ {a, b}∗ | aa is not a substring of x}L2 = {x ∈ {a, b}∗ | x ends with ab}Construct an FA Accepting L1 ∩ L2
0 votes
0 votes
1 answer
4
Bhumika Gupta asked Feb 11, 2018
492 views
Is the following DFA valid ?? Can we go to same state from a same state with different inputs ??