logo
  • Home
  • Rank
  • Tests
  • About
  • Training
  • Programming
  • CS
  • IT
  • IS
  • ECE
  • EEE
  • EE
  • Civil
  • Mechanical
  • Chemical
  • Metallurgy
  • Instrumentation
  • Aeronautical
  • Aerospace
  • Biotechnology
  • Agriculture
  • MCA
  • BCA
  • Internship
  • Contact

Automata Theory Multiple Choice Questions | MCQs | Quiz

Automata Theory Interview Questions and Answers
Practice Automata Theory questions and answers for interviews, campus placements, online tests, aptitude tests, quizzes and competitive exams.

Get Started

•   Finite Automata Introduction
•   Moore Machine
•   Mealy Machine - 1
•   Mealy Machine - 2
•   Finite Automata Definitions
•   DFA Processing Strings
•   Simpler Notations
•   DFA Language
•   Finite Automata
•   Non Deterministic Automata
•   Transition Function
•   NFA Language
•   NFA & DFA Equivalence
•   DFA Applications
•   NFA Applications
•   Epsilon Transition
•   Epsilon Transitions Uses
•   Epsilon Closures
•   Union & Intersection
•   Regular Expression basics
•   Regular Operators
•   Regular Expressions
•   DFA Regular Expressions
•   States Conversion
•   Regular Language - 1
•   Regular Language - 2
•   Expressions-Automata
•   UNIX Regular Expression
•   Lexical Analysis
•   Text Patterns
•   Non Regular Languages
•   Pumping Lemma
•   Lemma Applications
•   Closure Properties
•   Reversal Homomorphism
•   Conversions
•   Emptiness Testing
•   Free Grammar Derivations
•   Inferences & Ambiguity
•   Sentential Forms
•   Parse Tree Construction
•   Trees Inference & Derivation
•   Parsers Applications
•   YACC Parser Generator
•   Markup Languages
•   Ambiguous Grammar
•   State PDA-Acceptance
•   Stack PDA-Acceptance
•   Push Down Automata
•   PDA - Grammars
•   Deterministic PDA
•   Regular Language & DPDA
•   DPDA & Free Languages
•   DPDA & Ambiguous
•   CFG Useless Symbols
•   Epsilon Productions
•   Eliminating Unit Production
•   Chomsky Normal Form
•   Context Free Language
•   CFL-Closure Properties
•   CFL-Other Normal Forms
•   Intersections
•   Transition Diagrams
•   Turing Machine Language-1
•   Turing Machine Language-2
•   Turing Machine & Halting
•   Programming Techniques
•   Multitape Turing Machines
•   One-Tape & Multitape TM's
•   Non Deterministic TM's
•   Multistack Machines
•   Turing Machine Simulation
•   Diagonalization Languages
•   Undecidability
•   Rice's Theorem & PCP
•   Polynomial Time Problems
•   Polynomial Time
•   Hamilton Circuit Problem
•   PSPACE
•   Randomized Algorithm
•   RP & ZPP Complexity

Best Reference Books

Automata Theory Books

« Prev Page
Next Page »

Automata Theory Questions and Answers – The Language of NFA

Posted on May 17, 2017 by Manish

This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “The Language of NFA”.

1. Subset Construction method refers to:
a) Conversion of NFA to DFA
b) DFA minimization
c) Eliminating Null references
d) ε-NFA to NFA
View Answer

Answer: a
Explanation: The conversion of a non-deterministic automata into a deterministic one is a process we call subset construction or power set construction.
advertisement

2. Given Language:
Ln= {xϵ {0,1} * | |x|≥n, nth symbol from the right in x is 1}
How many state are required to execute L3 using NFA?
a) 16
b) 15
c) 8
d) 7
View Answer

Answer: b
Explanation: The finite automaton for the given language is made and thus, the answer can be obtained.

3. Which of the following does the given NFA represent?
automata-theory-questions-answers-the-language-nfa-q3
a) {11, 101} * {01}
b) {110, 01} * {11}
c) {11, 110} * {0}
d) {00, 110} * {1}
View Answer

Answer: c
Explanation: The given diagram can be analysed and thus the option can be seeked.

4. The number of transitions required to convert the following into equivalents DFA:
automata-theory-questions-answers-the-language-nfa-q4
a) 2
b) 3
c) 1
d) 0
View Answer

Answer: a
Explanation:
automata-theory-questions-answers-the-language-nfa-q4a
advertisement

5. If L is a regular language, Lc and Lr both will be:
a) Accepted by NFA
b) Rejected by NFA
c) One of them will be accepted
d) Cannot be said
View Answer

Answer: a
Explanation: If L is a regular Language, Lc and Lr both are regular even.

6. In NFA, this very state is like dead-end non final state:
a) ACCEPT
b) REJECT
c) DISTINCT
d) START
View Answer

Answer: b
Explanation: REJECT state will be like a halting state which rejects a particular invalid input.

7. We can represent one language in more one FSMs, true or false?
a) TRUE
b) FALSE
c) May be true
d) Cannot be said
View Answer

Answer: a
Explanation: We can represent one language in more one FSMs, example for a same language we have a DFA and an equivalent NFA.
advertisement

8. The production of form non-terminal -> ε is called:
a) Sigma Production
b) Null Production
c) Epsilon Production
d) All of the mentioned
View Answer

Answer: b
Explanation: The production of form non-terminal ->ε is call null production.

9. Which of the following is a regular language?
a) String whose length is a sequence of prime numbers
b) String with substring wwr in between
c) Palindrome string
d) String with even number of Zero’s
View Answer

Answer: d
Explanation: DFSM’s for the first three option is not possible; hence they aren’t regular.

10. Which of the following recognizes the same formal language as of DFA and NFA?
a) Power set Construction
b) Subset Construction
c) Robin-Scott Construction
d) All of the mentioned
View Answer

Answer: d
Explanation: All the three option refers to same technique if distinguishing similar constructions for different type of automata.

Sanfoundry Global Education & Learning Series – Automata Theory.
To practice all areas of Automata Theory, here is complete set of 1000+ Multiple Choice Questions and Answers.

« Prev Page - Automata Theory Questions and Answers – Extended Transition Function
» Next Page - Automata Theory Questions and Answers – Equivalence of NFA and DFA

« Automata Theory Questions and Answers – Extended Transition Function
Automata Theory Questions and Answers – Equivalence of NFA and DFA »
advertisement

Deep Dive @ Sanfoundry:

  1. C# Programming Examples on Functions
  2. PHP Questions and Answers
  3. C++ Programming Examples on Set & String Problems & Algorithms
  4. C Programming Examples on Set & String Problems & Algorithms
  5. Electromagnetic Theory Questions and Answers
  6. Compilers Questions and Answers
  7. Network Theory Questions and Answers
  8. Automata Theory Questions and Answers
  9. Automata Theory Questions and Answers – The Language of Turing Machine-2
  10. Automata Theory Questions and Answers – Applications of NFA
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He is Linux Kernel Developer and SAN Architect and is passionate about competency developments in these areas. He lives in Bangalore and delivers focused training sessions to IT professionals in Linux Kernel, Linux Debugging, Linux Device Drivers, Linux Networking, Linux Storage & Cluster Administration, Advanced C Programming, SAN Storage Technologies, SCSI Internals and Storage Protocols such as iSCSI & Fiber Channel. Stay connected with him below:
LinkedIn | Facebook | Twitter | Google+

Best Careers

Developer Tracks
SAN Developer
Linux Kernel Developer
Linux Driver Developer
Linux Network Developer

Live Training Photos
Mentoring
Software Productivity
GDB Assignment
Sanfoundry is No. 1 choice for Deep Hands-ON Trainings in SAN, Linux & C, Kernel Programming. Our Founder has trained employees of almost all Top Companies in India such as VMware, Citrix, Oracle, Motorola, Ericsson, Aricent, HP, Intuit, Microsoft, Cisco, SAP Labs, Siemens, Symantec, Redhat, Chelsio, Cavium, ST-Micro, Samsung, LG-Soft, Wipro, TCS, HCL, IBM, Accenture, HSBC, Mphasis, Tata-Elxsi, Tata VSNL, Mindtree, Cognizant and Startups.

Best Trainings

SAN I - Technology
SAN II - Admin
Linux Fundamentals
Advanced C Training
Linux-C Debugging
System Programming
Network Programming
Linux Threads
Kernel Programming
Kernel Debugging
Linux Device Drivers

Best Reference Books

Computer Science Books
Algorithm & Programming Books
Electronics Engineering Books
Electrical Engineering Books
Chemical Engineering Books
Civil Engineering Books
Mechanical Engineering Books
Industrial Engineering Books
Instrumentation Engg Books
Metallurgical Engineering Books
All Stream Best Books

Questions and Answers

1000 C Questions & Answers
1000 C++ Questions & Answers
1000 C# Questions & Answers
1000 Java Questions & Answers
1000 Linux Questions & Answers
1000 Python Questions
1000 PHP Questions & Answers
1000 Hadoop Questions
Cloud Computing Questions
Computer Science Questions
All Stream Questions & Answers

India Internships

Computer Science Internships
Instrumentation Internships
Electronics Internships
Electrical Internships
Mechanical Internships
Industrial Internships
Systems Internships
Chemical Internships
Civil Internships
IT Internships
All Stream Internships

About Sanfoundry

About Us
Copyright
Terms
Privacy Policy
Jobs
Bangalore Training
Online Training
Developers Track
Mentoring Sessions
Contact Us
Sitemap
© 2011 Sanfoundry. All Rights Reserved.