Skip to content
Related Articles
Open in App
Not now

Related Articles

Theory of Computation | Regular languages and finite automata | Question 2

Improve Article
Save Article
  • Difficulty Level : Medium
  • Last Updated : 10 Sep, 2018
Improve Article
Save Article

What is the complement of the language accepted by the NFA shown below?

gatecs2012automata
(A) A
(B) B
(C) C
(D) D


Answer: (B)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Related Articles
1. Difference between Pushdown Automata and Finite Automata
2. Regular Expressions, Regular Grammar and Regular Languages
3. Designing Finite Automata from Regular Expression (Set 1)
4. Generating regular expression from Finite Automata
5. Designing Finite Automata from Regular Expression (Set 6)
6. Designing Finite Automata from Regular Expression (Set 2)
7. Designing Finite Automata from Regular Expression (Set 3)
8. Designing Finite Automata from Regular Expression (Set 4)
9. Designing Finite Automata from Regular Expression (Set 5)
10. Designing Finite Automata from Regular Expression (Set 7)
Previous
NPDA for L = {0i1j2k | i==j or j==k ; i , j , k >= 1}
Next
Halting Problem in Theory of Computation
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty : Medium
Article Tags :
Practice Tags :
Report Issue
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox

Start Your Coding Journey Now!