Theory of Computation and Compilers MCQ - Regular Language Models

16 Which of the following are not regular?

A
String of 0's whose length is a perfect square
B
Set of all palindromes made up of 0's and 1's
C
Strings of 0's, whose length is a prime number
D
All of these

View Explanation
Comment

Correct AnswerOption D

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

Share this question

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.

Cancel reply

Your email address will not be published. Required fields are marked *

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

Your email address will not be published. Required fields are marked *

Comment *

Name

Save my name and email in this browser for the next time I comment.

17 The main difference between a DFSA and an NDFSA is

A
in DFSA, ε transition may be present
B
in NDFSA, ε transitions may be present.
C
in DFSA, from any given state, there can't be any alphabet leading to two different states
D
in NDFSA, from any given state, there can't be any alphabet leading to two different states

View Explanation
Comment

Correct AnswerOption C

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

Cancel reply

Your email address will not be published. Required fields are marked *

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

Your email address will not be published. Required fields are marked *

Comment *

Name

Save my name and email in this browser for the next time I comment.

18 If w ∈ (a, b)* satisfy abw = wab, then (w) is

A
even
B
odd
C
Null
D
none of these

View Explanation
Comment

Correct AnswerOption A

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

Cancel reply

Your email address will not be published. Required fields are marked *

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

Your email address will not be published. Required fields are marked *

Comment *

Name

Save my name and email in this browser for the next time I comment.

19 A PDM behaves like an FSM wnen the number of auxiliary memory it has, is

A
0
B
1
C
2
D
None of these

View Explanation
Comment

Correct AnswerOption A

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

Cancel reply

Your email address will not be published. Required fields are marked *

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

Your email address will not be published. Required fields are marked *

Comment *

Name

Save my name and email in this browser for the next time I comment.

20 Finite state machine can recognize

A
any grammar
B
only context-free grammar
C
Both (A) and (B)
D
only regular grammar

View Explanation
Comment

Correct AnswerOption D

Rate difficulty Rate difficulty:

Easy Medium Hard

Choose a difficulty.

Found this useful?

Follow:

Cancel reply

Your email address will not be published. Required fields are marked *

Report

Name

Save my name and email in this browser for the next time I comment.

Cancel reply

Your email address will not be published. Required fields are marked *

Comment *

Name

Save my name and email in this browser for the next time I comment.

First Previous 2 3 4 5 6 Next Last