Finite Automata Interview Questions and Answers | Automata Theory Solved MCQ | MCQ
1. According to Noam Chomsky Turing Machine will Accepts ___________. a) Regular Language b) CFL c) CSL d) Recursively Enumerable Language View Answer: D 2. X à αY | α is the production rule for_____________________ a) Regular grammar b) Context Free Grammar c) Right Linear Grammar d) Left Linear Grammar View Answer: C 3. Context Free grammar is ______________ tuple grammar a) 3 b) 4 c) 2 d) can’t be represented. View Answer: B 4. Type-2 grammar has production rule of the form a) X à αY | α where α ε T & X,Y ε V b) X à Yα | α where α ε T & X,Y ε V c) X à α where α ε (V UT )* & X ε V d) None View Answer: C 5. Generation of language using specific rule is called_________________ a) Derivation b) Optimization c) Analysis d) None of the mentioned View Answer: A 6. A grammar is said to be ambiguous if there exists _______________________ a) More than one LMD b) More than one RMD c) More