Peter Linz Edition 4 Exercise 3.1 Question 7 (Page No. 76) Exercise 3.3 Question 9 (Page No. 97)

Question

Regular Expression:-

Q1)   What languages do the expression (∅*)* and a∅ denote?

Q2)   Find a regular expression and finite automata for all bit strings, with leading bit 1 interpreted as a binary integer, with values not between 10 and 30.

Regular Grammar:-

Q1)   Suggest a construction by which a left-linear grammar can be obtained from an nfa directly.

Q2)   Find a regular grammar and draw the nfa or dfa that generates the language 

                 L = { w ∈ {a, b}* /  (number of a in w + 3*number of b)  in w is even }

Answer 1

Is the below FA correct for the last question.

Answer 2

Regular Expression :

1) L={},  means "Empty Language" is denoted by the both of Expression.

Answer 3

Please Correct me If I am wrong.

Regular Grammar:-

Q2.

DFA for the required language.

.

Grammar :

S->aA /bA / λ

A->aS / bS