This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Extended Transition Function”. 1. The number of tuples in an extended Non Deterministic Finite Automaton: a) 5 b) 6 c) 7 d) 4 2. Choose the correct option for the given statement: Statement: The DFA shown represents all strings which has 1 … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Non Deterministic Finite Automata – Introduction” 1. Which of the following options is correct? Statement 1: Initial State of NFA is Initial State of DFA. Statement 2: The final state of DFA will be every combination of final state of NFA. a) … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Regular Language & Expression”. 1. There are ________ tuples in finite state machine. a) 4 b) 5 c) 6 d) unlimited 2. Transition function maps. a) Σ * Q -> Σ b) Q * Q -> Σ c) Σ * Σ -> … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “The Language of DFA” 1. How many languages are over the alphabet R? a) countably infinite b) countably finite c) uncountable finite d) uncountable infinite 2. According to the 5-tuple representation i.e. FA= {Q, ∑, δ, q, F} Statement 1: q ϵ … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Simpler Notations”. 1.Given Language: L= {xϵ∑= {a, b} |x has a substring ‘aa’ in the production}. Which of the corresponding representation notate the same? a) b) c) d) 2.Let u=’1101’, v=’0001’, then uv=11010001 and vu= 00011101.Using the given information what is the … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “DFA Processing Strings”. 1. The password to the admins account=”administrator”. The total number of states required to make a password-pass system using DFA would be __________ a) 14 states b) 13 states c) 12 states d) A password pass system cannot be … Read more
This set of Automata Theory Interview Questions and Answers focuses on “Deterministic Finite Automata-Introduction and Definition”. 1. Which of the following not an example Bounded Information? a) fan switch outputs {on, off} b) electricity meter reading c) colour of the traffic light at the moment d) none of the mentioned 2. A Language for which … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Mealy Machine-II”. 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 “Mealy Machine”. 1. In mealy machine, the O/P depends upon? a) State b) Previous State c) State and Input d) Only Input 2. Which of the given are correct? a) Moore machine has 6-tuples b) Mealy machine has 6-tuples c) Both Mealy … Read more
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Moore Machine”. 1. Moore Machine is an application of: a) Finite automata without input b) Finite automata with output c) Non Finite automata with output d) None of the mentioned 2. In Moore machine, output is produced over the change of: a) … Read more
