adplus-dvertising

Welcome to the Finite Automata and Regular Expression MCQs Page

Dive deep into the fascinating world of Finite Automata and Regular Expression with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Finite Automata and Regular Expression, a crucial aspect of Compiler Design. In this section, you will encounter a diverse range of MCQs that cover various aspects of Finite Automata and Regular Expression, 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 Compiler Design.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Finite Automata and Regular Expression. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Compiler Design.

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

Finite Automata and Regular Expression MCQs | Page 6 of 6

Explore more Topics under Compiler Design

Q51.
Which NDFA correctly represents the following RE :

a(bab)*∊a(ba)*

a.

a

b.

b

c.

c

d.

d

Discuss
Answer: (a).a
Q52.
Which is the correct NDFA for the following mentioned expression? (ab)*∊(aba)*.

a.

a

b.

b

c.

c

d.

d

Discuss
Answer: (b).b
Q53.
Construct a NDFA for the following regular expression :

(a∊b)*aba(a∊b)*

a.

a

b.

b

c.

c

d.

d

Discuss
Answer: (a).a
Q54.
A deterministic finite automation (DFA)D with alphabet ∑= {a,b} is given below.
Which of the following is a valid minimal DFA which accepts the same language as D?

a.

a

b.

b

c.

c

d.

d

Discuss
Answer: (a).a
Q55.
What is the complement of the language accepted by the NFA shown below? Assume ∑ = {a} and Îĩ is the empty string.

a.

ÎĶ

b.

Îĩ

c.

a

d.

{a, Îĩ}

Discuss
Answer: (b).Îĩ
Q56.
Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. Complete the partially completed DFA that accepts this language is shown below. The missing arcs in the DFA are

a.

a

b.

b

c.

c

d.

d

Discuss
Answer: (d).d
Q57.
Convert the NFA to DFA

a.

a

b.

b

c.

c

d.

d

Discuss
Answer: (a).a
Q58.
Examine the following DFA: If input is 011100101, which edge is NOT traversed?

a.

A B

b.

C

c.

C D

d.

D A

Discuss
Answer: (c).C D
Q59.
If string s is accepted by this DFA, which of these strings cannot be suffix of s?

a.

111001

b.

111111

c.

111000

d.

101010

Discuss
Answer: (a).111001
Page 6 of 6

Suggested Topics

Are you eager to expand your knowledge beyond Compiler Design? 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!

Systems Analysis and Design Methods

Get familiar with the process of designing and improving business systems with our...

Cloud Computing

Stay on top of the biggest trend in IT with our Cloud Computing MCQs. These questions...

Management Information Systems

Discover how businesses leverage technology with our Management Information Systems...

PHP

Venture into server-side scripting with our PHP MCQs. Cover everything from syntax...

Data Science

Discover the fascinating world of extracting insights from data with our Data Science...

Discrete Mathematics

Refine your mathematical skills essential for computer science with our Discrete...

MongoDB

Learn the leading NoSQL database with our MongoDB MCQs. Understand everything from...

SQL Server

Master Microsoft's database server with our SQL Server MCQs. Topics cover database...

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...