Kerala State PSC Exam Model Paper 4

© examsiri.com

Question : 27 of 100

Marks: +1, -0

Which of the following statements is wrong ?

For every DFA there is a regular expression denoting its language
The language accepted by finite automata are the languages denoted by regular expressions
None of these
For a regular expression r, there does not exist NFA with L(r) any transit that accept

Go to Question:

Prev Question

Next Question