edited by
492 views
0 votes
0 votes

Is the following DFA valid ?? Can we go to same state from a same state with different inputs ??

edited by

1 Answer

1 votes
1 votes

S,it is a valid DFA  bcz on each state there is a move for both input{a,b} and the given DFA accepting  epsilon  only 

on q0 state and q1 is a dead state.

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
1 votes
1 votes
1 answer
4
Don't you worry asked Jun 11, 2016
3,556 views
Construct a DFA to accept all strings (1+0)^ with an equal no of zeros and 1's ,such that each prefix has atmost one more zero then 1's and at most one more 1's then zero...