adplus-dvertising

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.

frame-decoration

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

Explore more Topics under Formal Languages and Automata Theory

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

a.

35

b.

360

c.

49

d.

720

Discuss
Answer: (b).360
Q2.
Which of the following CFG’s can’t be simulated by an FSM ?

a.

S->Sa/b

b.

S->aSb/ab

c.

S->abX, X->cY, Y->d/aX

d.

None of these

Discuss
Answer: (b).S->aSb/ab
Q3.
The transitions which does not take an input symbol are called

a.

Ξ΅-transitions

b.

Ξ»-transitions

c.

None of these

d.

Both of the mentioned

Discuss
Answer: (d).Both of the mentioned
Q4.
Which of the following strings is NOT in the Kleene star of the language {011, 10, 110}?

a.

01

b.

10

c.

110

d.

10011101

Discuss
Answer: (d).10011101
Q5.
Which of the following is true ?

a.

All subsets of a regular set are always regular

b.

All finite subsets of non-regular set are always regular

c.

Union of two non regular set of language is not regular

d.

Infinite times union of finite set is always regular

Discuss
Answer: (b).All finite subsets of non-regular set are always regular
Q6.
L and ~L are recursive enumerable then L is

a.

Regular

b.

Context free

c.

Context sensitive

d.

Recursive

Discuss
Answer: (d).Recursive
Q7.
Consider the production of the grammar:

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

Describe the language specified by the production grammar.

a.

L = {aaaa,aabb,bbaa,bbbb}

b.

L = {abab,abaa,aaab,baaa}

c.

L = {aaab,baba,bbaa,bbbb}

d.

L = {aaaa,abab,bbaa,aaab}

Discuss
Answer: (a).L = {aaaa,aabb,bbaa,bbbb}
Q8.
Let R1 and R2 be regular sets defined over alphabet βˆ‘ then

a.

R1 UNION R2 is regular

b.

R1 INTERSECTION R2 is regular

c.

βˆ‘ INTERSECTION R2 IS NOT REGULAR

d.

R2* IS NOT REGULAR

Discuss
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}?

a.

aaabbbbbb

b.

aabbb

c.

abbabbba

d.

aaaabbbabb

Discuss
Answer: (a).aaabbbbbb
Q10.
Give a production grammar for the language L = {x/x ∈ (a,b)*, the number of a’s in x is multiple of 3}.

a.

{S->bS, S->b,S->aA, S->bA, A->aB, B->bB, B->aS, S->a}

b.

{S->aS,S->bA,A->bB,B->bBa,B->bB}

c.

{S->aaS,S->bbA,A->bB,B->ba}

d.

None of the above

Discuss
Answer: (a).{S->bS, S->b,S->aA, S->bA, A->aB, B->bB, B->aS, S->a}
Page 1 of 3

Suggested Topics

Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Cyber Security

Understand the fundamentals of safeguarding digital assets with our Cyber Security...

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

Object Oriented Programming Using C++

Enhance your programming skills with our MCQs on Object Oriented Programming using...

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

Digital Logic Design

Understand the foundation of digital computers with our Digital Logic Design MCQs....

Wireless and Mobile Communications

Get to grips with modern communication technologies with our Wireless and Mobile...

Systems Programming

Decode low-level programming with our Systems Programming MCQs. These questions delve...