Welcome to the Regular Expressions MCQs Page

Dive deep into the fascinating world of Regular Expressions with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Regular Expressions, 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 Regular Expressions, 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 Regular Expressions. 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 Regular Expressions. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Regular Expressions MCQs | Page 2 of 15

Explore more Topics under Formal Languages and Automata Theory

01

Basics of Automata Theory

02

Finite Automata

03

DFA Minimization

04

Context Free Grammars

05

Regular Languages

06

Push Down Automata

07

Context Free Languages

08

Introduction to Turing Machines

09

Undecidability and Intractable Problems

Q11.

The regular expression have all strings of 0′s and 1′s with no two consecutive 0′s is :

(0+1)

(0+1)*

(0+∈) (1+10)*

(0+1)* 011

Discuss

Answer: (c).(0+∈) (1+10)*

Q12.

The regular expression with all strings of 0′s and 1′s with at least two consecutive 0′s is:

1 + (10)*

(0+1)*00(0+1)*

(0+1)*011

0*1*2*

Discuss

Answer: (b).(0+1)*00(0+1)*

Q13.

Which of the following is NOT the set of regular expression R = (ab + abb)* bbab

ababbbbab

abbbab

ababbabbbab

abababab

Discuss

Answer: (a).ababbbbab

Q14.

String generated by
S->aS/bA,
A->d/ccA

aabccd

adabcca

abcca

abababd

Discuss

Answer: (a).aabccd

Q15.

Consider the production of the grammar S->AA A->aa A->bb Describe the language specified by the production grammar.

L = {aaaa,aabb,bbaa,bbbb}

L = {abab,abaa,aaab,baaa}

L = {aaab,baba,bbaa,bbbb}

L = {aaaa,abab,bbaa,aaab}

Discuss

Answer: (a).L = {aaaa,aabb,bbaa,bbbb}

Q16.

If R is regular language and Q is any language (regular/ non regular), then Pref (Q in R) is ———.

Non-regular

Equal

Infinite

Regular

Discuss

Answer: (d).Regular

Q17.

Regular expression a/b denotes the set

{a}

{ ∈ , a, b }

{a, b}

{ ab }

Discuss

Answer: (c).{a, b}

Q18.

In regular expressions, the operator ‘*’ stands for

Concatenation

Selection

Iteration

Addition

Discuss

Answer: (c).Iteration

Q19.

Find the pair of regular expressions that are equivalent

(0+1)* and (0*+1*)*

(0+1)* and (0+1*)*

(0+10)* and (0*+10)*

All of the mentioned

Discuss

Answer: (d).All of the mentioned

Q20.

Consider alphabet ∑ = {0, 1}, the null/empty string λ and the sets of strings X0, X1 and X0.How are X1 and X2 are related ?

X0 = 1 X1
X1 = 0 X1 + 1 X2
X2 = 0 X1 + {λ}

Which one of the following represents the strings in X0?

10 (0* + (10)*)1

10 (0* + (10)*)*1

10 (0 + 10)*1 + 110 (0 + 10)*1

Discuss

Answer: (c).10 (0* + (10)*)*1

Page 2 of 15

Welcome to the Regular Expressions MCQs Page

Regular Expressions MCQs | Page 2 of 15

Explore more Topics under Formal Languages and Automata Theory

Basics of Automata Theory

Finite Automata

DFA Minimization

Context Free Grammars

Regular Languages

Push Down Automata

Context Free Languages

Introduction to Turing Machines

Undecidability and Intractable Problems

Suggested Topics

Object Oriented Programming Using C++

Embedded Systems

Reverse Engineering

PHP

Data Science

Compiler Design

MATLAB

Neural Networks

UNIX