Regular Language & Regular Expression

Question 1

If all states of an NFA are accepting states then the language accepted by the NFA is Σ*. True or False?

Answer 1

False, as in NFA, it is not necessary that all states have transitions for all symbols.

Question 2

There exists a regular language A such that for all languages B , A ∧ B is regular. True or false?

Answer 2

True, there exists a regular language {}

Question 3

Every finite subset of a non-regular set is regular. True or false?

Answer 3

True

Question 4

Every subset of a regular set is regular. True or false

Answer 4

False

Question 5

Every finite subset of a regular set is regular. True or false

Answer 5

True

Question 6

The intersection of two regular sets is regular. True or false

Answer 6

True

Question 7

What is grammar in TOC?

Answer 7

It is a finite set of formal rules for generating syntactically correct sentences or meaningful correct sentences

Question 8

Every finite language is regular. True or False

Answer 8

True