 (https://www.facebook.

com/AcademyEra-1221155144753951/)
 (https://www.instagram.com/academyera/)
 (https://www.youtube.com/channel/UC77HKIAceNlaRYkZoaHBwyA)
 (mailto:academyera.com@gmail.com)

Menu
(https://academyera.com/)

Algorithms Gate Questions on DFA |

(http://academyera.co
m/algorithms) Deterministic Finite Automaton
Data Structures
(https://academyera.c
Question 1
om/data-structures-
What are the final states of the DFA generated from the
psu-subject-wise-
solved-questions) following NFA?

Theory of
Computations
(https://academyera.c
om/theory-of-
computation-subject-
wise)
(https://academyera.com/screenshot-40)

Compiler Design
(https://academyera.c
om/compiler-design-
A q0, q1, q2

subject-wise)

B [q0, q1], [q0, q2], [ ]

Operating Systems
(http://academyera.co
m/operating-systems-
C q0, [q1, q2]
subject-wise-gate-cs-
questions)
D [q0, q1], q2

Computer Networks
(https://academyera.c
om/computer- Discuss (https://academyera.com/isro-cs-2013-dfa)ISRO CS 2013
networks-subject- (http://academyera.com/psu-previous-year-question-papers/ ) Theory
Computation (https://academyera.com/theory-of-computation-subject-w
wise) DFA ()
Question 2
Digital Logic Design
(https://academyera.c Given two DFA's M1 and M2. They are equivalent if:
om/digital-logic-
design-subject-wise)
A M1 and M2 has the same number of states

Database
Management
System
(https://academyera.c
om/database-
B M1 and M2 accepts the same language i.e L(M1)=L(M2)
management-system-
psu-subject-wise-
solved-questions) C M1 and M2 has the same number of final states

Computer D None of the above

Organization
(https://academyera.c
om/computer-
organization-subject- Discuss (https://academyera.com/nielit-scientist-b-cs-4-12-2016-
wise) dfa)Nielit Scientist-B CS 4-12-2016 (http://academyera.com/psu-previou
year-question-papers/ ) Theory-of-Computation
(https://academyera.com/theory-of-computation-subject-wise) DFA ()
Aptitude Question 3
(https://academyera.c
om/gate-aptitude- State whether TRUE or FALSE (i) In NDFA, the transition
questions) function δ: Q × Σ → 2Q (ii) NDFA does not permit empty string
transitions
Graph Theory
(https://academyera.c
om/graph-theory- A (i) False (ii) False
engineering-
mathematics-psu-
topic-wise-solved-
questions)
B (i) True (ii) False

Engineering
C (i) False (ii) True

Mathematics
(https://academyera.c
om/engineering-
D (i) True (ii) True
mathematics-psu-
subject-wise-solved-
questions)
Discuss (https://academyera.com/jtit-2018-part-b-computer-science-
dfa)JT(IT) 2018 PART-B Computer Science (http://academyera.com/psu-
previous-year-question-papers/ ) Theory-of-Computation
Study Materials (https://academyera.com/theory-of-computation-subject-wise) DFA ()
(https://academyera.c
om/category/gate- Question 4
cse/gate-cs-
notes/study-materials) The number of states in a minimal deterministic finite
automaton corresponding to the language L = { an | n≥4 } is

A 3

B 4

C 5

D 6

Discuss (https://academyera.com/ugc-net-cs-2013-sep-paper-2-dfa)U
NET CS 2013 Sep-paper-2 (http://academyera.com/psu-previous-year-
/) fC
 question-papers/ ) Theory-of-Computation
(https://academyera.com/theory-of-computation-subject-wise) DFA ()
There are 4 questions to complete.

Leave a Reply

Your Comment Here...

Name (required) Email (required) Website

Save my name, email, and website in this browser for the next
time I comment.

POST C O MMENT

© Copyright 2020 , All rights reserved TERMS OF USE (https://academyera.com/terms-of-use) |

PRIVACY POLICY (https://academyera.com/privacy-policy) |
CONTACT US (https://academyera.com/contact-us) |
COOKIE POLICY (https://academyera.com/cookie-policy)