Test: Finite Automata & Regular Expressions

# Test: Finite Automata & Regular Expressions

Test Description

## 15 Questions MCQ Test Compiler Design | Test: Finite Automata & Regular Expressions

Test: Finite Automata & Regular Expressions for Computer Science Engineering (CSE) 2023 is part of Compiler Design preparation. The Test: Finite Automata & Regular Expressions questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: Finite Automata & Regular Expressions MCQs are made for Computer Science Engineering (CSE) 2023 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Finite Automata & Regular Expressions below.
Solutions of Test: Finite Automata & Regular Expressions questions in English are available as part of our Compiler Design for Computer Science Engineering (CSE) & Test: Finite Automata & Regular Expressions solutions in Hindi for Compiler Design course. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: Finite Automata & Regular Expressions | 15 questions in 15 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study Compiler Design for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
 1 Crore+ students have signed up on EduRev. Have you?
Test: Finite Automata & Regular Expressions - Question 1

### Number of states of FSM required to simulate behaviour of a computer with a memory capable of storing “m” words, each of length ‘n’

Test: Finite Automata & Regular Expressions - Question 2

### An FSM with

Test: Finite Automata & Regular Expressions - Question 3

### Which of the following is right?

Test: Finite Automata & Regular Expressions - Question 4

Given a NFA with N states, the maximum number of states in an equivalent minimized DFA is at least.

Test: Finite Automata & Regular Expressions - Question 5

Let L denotes the language generated by the grammar S – OSO/00. Which of the following is true?

Test: Finite Automata & Regular Expressions - Question 6

Which of the following pairs of regular expressions are equivalent?

Detailed Solution for Test: Finite Automata & Regular Expressions - Question 6

Explanation:
Rule (pq)*p=p (qp)*
Therefore–(xx*) (x*x**)
(xx*)(x*x*) [Using x**=x] (xx*)(x*) [Using x*x*=x*] (xx*) [Using x*xx*=x*)
x+

Test: Finite Automata & Regular Expressions - Question 7

Let L denotes the language generated by the grammar S ->0S0/00. Which of the following is true?

Detailed Solution for Test: Finite Automata & Regular Expressions - Question 7

Explanation: The grammar itself is not regular but language L is regular as L can be represented using a regular grammar, for example S -> S00/00.

Test: Finite Automata & Regular Expressions - Question 8

Which of the following are not regular?

Detailed Solution for Test: Finite Automata & Regular Expressions - Question 8

Explanation: Strings of odd number of zeroes can be generated by the regular expression (00) *0.Pumping lemma can be used to prove the non-regularity of the other options.

Test: Finite Automata & Regular Expressions - Question 9

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

Detailed Solution for Test: Finite Automata & Regular Expressions - Question 9

Explanation: Here string length is 4 so we create string of length 4 by 6 values firstly we arrange any value by 6 methods. Then Remaining numbers are 5 so we can arrange them by 5 methods then remaining numbers are 4 so we arrange them by 4 methods and then 3.Thus 6*5*4*3=360.

Test: Finite Automata & Regular Expressions - Question 10

Which one of the following statement is FALSE?

Detailed Solution for Test: Finite Automata & Regular Expressions - Question 10

Explanation: CFL is closed under Kleene closure, concatenation, and Union

Test: Finite Automata & Regular Expressions - Question 11

Which of the following strings is not generated by the following grammar?S → SaSbS|ε

Detailed Solution for Test: Finite Automata & Regular Expressions - Question 11

Explanation:
S->aSbS putting S-> € and then S->SaSbS
S->aSaSaSbSbSbS putting S->SaSbS
S->aaabbb putting S->€.

Test: Finite Automata & Regular Expressions - Question 12

Regular expressions can be used only for values of type string and number.

Detailed Solution for Test: Finite Automata & Regular Expressions - Question 12

Explanation: RE is used for all types of string and numbers.

Test: Finite Automata & Regular Expressions - Question 13

What is the Regular Expression Matching Zero or More Specific Characters

Detailed Solution for Test: Finite Automata & Regular Expressions - Question 13

Explanation: Zero or Specific Expression matching can be done only by a single character that is*

Test: Finite Automata & Regular Expressions - Question 14

All __________ are automatically treated as regular expressions.

Detailed Solution for Test: Finite Automata & Regular Expressions - Question 14

Explanation: It is seen that programmatic description are treated as regular expression.

Test: Finite Automata & Regular Expressions - Question 15

The production Grammar is {S->aSbb,S->abb} is

Detailed Solution for Test: Finite Automata & Regular Expressions - Question 15

Explanation: As per the definition of type-2 grammar.

## Compiler Design

15 videos|55 docs|30 tests
 Use Code STAYHOME200 and get INR 200 additional OFF Use Coupon Code
Information about Test: Finite Automata & Regular Expressions Page
In this test you can find the Exam questions for Test: Finite Automata & Regular Expressions solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Finite Automata & Regular Expressions, EduRev gives you an ample number of Online tests for practice

## Compiler Design

15 videos|55 docs|30 tests