Register

Made easy workbook

• edited by
490 views

1 Answer

1 votes
1 votes

  • In every state have input alphabet is define then it is DFA .otherwise it is NFA.

  1. IN first diagram input alphabet is not define . So it is NFA.and there is no final state so it is " NFA accepting nothing"

Simillary we can solve all

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
jugnu1337 asked Sep 3, 2023
344 views
MADE EASY test series
FIND the no of 2 state dfa with the designated initial state possible over {a,b,c} which accept empty language is equal to
FIND the no of 2 state dfa with the designated initial state possible over {a,b,c} which accept empty language is equal to
User Avatar
0 votes
0 votes
1 answer
2
Souvik33 asked Dec 27, 2022
490 views
Made Easy Test Series | Theory Of Computation | Regular Grammar
The following language regular L*, where L={ $0^{{m}^{2}} | m\leq 3$ } True False
The following language regularL*, where L={ $0^{{m}^{2}} | m\leq 3$ }TrueFalse
User Avatar
0 votes
0 votes
1 answer
3
Luci3671 asked Nov 11, 2022
271 views
Made easy postal course example problem
What will be the DFA for wxw^r where w belongs to (a,b)^+ and x belongs to (a,b)^+
What will be the DFA for wxw^r where w belongs to (a,b)^+ and x belongs to (a,b)^+
User Avatar
0 votes
0 votes
0 answers
4
abhinowKatore asked Mar 7, 2022
480 views
MADE EASY 2022 Work book -Theory of Computation
Which of the following pairs of string belonging to Σ* are distinguishable by the following dfa?
Which of the following pairs of string belonging to Σ* are distinguishable by the following dfa?
User Avatar
Link Copied!