Register

Finite Automata : DFA

• edited by
960 views
0 0 votes

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

1 Answer

1 1 vote

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.

Voting & Accepting an answer helps improve the community
← Previous · Computer NetworkNext → · Subject Topic- Mathe...
← Previous in category · Complement of CFLNext in category → · GATE CSE 2018 | Ques...
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
1.5k
1.5k views
jayadev asked Jan 7, 2022
1,539 views
Deterministic Finite Automata ( DFA)
follow method first draw dfa for ‘a’ always followed by ‘bb’ and reverse it
0 0 votes
2 2 answers
6.2k
6.2k views
Sambhrant Maurya asked Sep 27, 2018
6,207 views
Deterministic Finite Automata ( DFA)
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 2 votes
2 2 answers
2.7k
2.7k views
set2018 asked Sep 21, 2017
2,698 views
dfa-finite automata
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 1 vote
1 answers 1 answer
4.8k
4.8k views
Don't you worry asked Jun 11, 2016
4,775 views
DFA Finite Automata
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...