Reqular Expressions

**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’

**2.**

An FSM with

**3.**

Which of the following is right?

**4.**

Consider the following two statements:

S1: { 0^2n |n >= l} is a regu1ar language

S2: { 0^m 0^n 0^(m+n) l m >= 1 and n >= 2} is a regu1ar language

Which of the following is true?

**5.**

Which of the following pairs of regular expressions are equivalent?

**6.**

Which of the following pairs of regular expressions are equivalent?

**7.**

Which of the following pairs of regular expressions are equivalent?

**8.**

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

**9.**

Regular expression (x/y)(x/y) denotes the set

**10.**

Regular expression x/y denotes the set