This set of Automata Theory Quiz focuses on “Building Regular Expressions”. 1. Which of the following is correct? Statement 1: ε represents a single string in the set. Statement 2: Ф represents the language that consist of no string. a) Statement 1 and 2 both are correct b) Statement 1 is false but 2 is … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Operators of Regular Expression”. 1. A finite automaton accepts which type of language: a) Type 0 b) Type 1 c) Type 2 d) Type 3 2. Which among the following are incorrect regular identities? a) εR=R b) ε*=ε c) Ф*=ε d) RФ=R … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Regular Expression-Introduction”. 1. L is a regular Language if and only If the set of __________ classes of IL is finite. a) Equivalence b) Reflexive c) Myhill d) Nerode 2. A language can be generated from simple primitive language in a simple … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Union, intersection and complement of Regular Language & Expression”. 1. Regular sets are closed under union,concatenation and kleene closure. a) True b) False c) Depends on regular set d) Can’t say 2. Complement of a DFA can be obtained by a) making … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Epsilon Closures”. 1. Which of the following does not belong to input alphabet if S={a, b}* for any language? a) a b) b c) e d) none of the mentioned 2. The number of final states we need as per the given … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Uses of Epsilon-Transitions”. 1. The automaton which allows transformation to a new state without consuming any input symbols: a) NFA b) DFA c) NFA-l d) All of the mentioned 2. e-transitions are a) conditional b) unconditional c) input dependent d) none of … Read more
This set of Automata Theory test focuses on “Finite Automata with Epsilon Transition”. 1. According to the given transitions, which among the following are the epsilon closures of q1 for the given NFA? Δ (q1, ε) = {q2, q3, q4} Δ (q4, 1) = q1 Δ (q1, ε) = q1 a) q4 b) q2 c) … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Applications of DFA”. 1. Given Language: {x | it is divisible by 3} The total number of final states to be assumed in order to pass the number constituting {0, 1} is a) 0 b) 1 c) 2 d) 3 2. A … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Equivalence of NFA and DFA”. 1. Under which of the following operation, NFA is not closed? a) Negation b) Kleene c) Concatenation d) None of the mentioned 2. It is less complex to prove the closure properties over regular languages using a) … Read more
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 2. Given Language: Ln= {xϵ {0,1} * | |x|≥n, nth symbol from the right in … Read more
