# Welcome to the Basics of Automata Theory MCQs Page

Dive deep into the fascinating world of Basics of Automata Theory with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Basics of Automata Theory, a crucial aspect of Formal Languages and Automata Theory. In this section, you will encounter a diverse range of MCQs that cover various aspects of Basics of Automata Theory, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Formal Languages and Automata Theory.

Check out the MCQs below to embark on an enriching journey through Basics of Automata Theory. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Formal Languages and Automata Theory.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Basics of Automata Theory. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

### Basics of Automata Theory MCQs | Page 1 of 3

Q1.
If ∑ = {a, b, c, d, e, f} then number of strings in ∑ of length 4 such that no symbol is used more than once in a string is
Q2.
Which of the following CFG’s can’t be simulated by an FSM ?
Q3.
The transitions which does not take an input symbol are called
Q4.
Which of the following strings is NOT in the Kleene star of the language {011, 10, 110}?
Q5.
Which of the following is true ?
Answer: (b).All finite subsets of non-regular set are always regular
Q6.
L and ~L are recursive enumerable then L is
Q7.
Consider the production of the grammar:

S->AA A->aa A->bb

Describe the language specified by the production grammar.
Q8.
Let R1 and R2 be regular sets defined over alphabet ∑ then
Answer: (a).R1 UNION R2 is regular
Q9.
Which of the following strings can be obtained by the language L = { a^i b^2i / i≥ 1}?