info@avatto.com
+91-9920808017

Follow Us :

Login / Register

ABOUT EXAMS
- UGC NET Exam
- Commerce Exams
- GATE Exams
- About CTET
- NATA
- ACET

Theory of Computation - Regular Language Models

Avatto > > GATE COMPUTER SCIENCE > > Practice Questions > > Computer Science And Information Technology > > Theory of Computation > > 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

Answer
Comment
Array

Option : D
Explanation :
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.

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

Report

Name

Email

Website

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

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

Comment

Name

Email

Website

Save my name, email, and website 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

Answer
Comment
Array

Option : C
Explanation :

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

Report

Name

Email

Website

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

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

Comment

Name

Email

Website

Save my name, email, and website 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

Answer
Comment
Array

Option : A
Explanation :

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

Report

Name

Email

Website

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

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

Comment

Name

Email

Website

Save my name, email, and website 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

Answer
Comment
Array

Option : A
Explanation :

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

Report

Name

Email

Website

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

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

Comment

Name

Email

Website

Save my name, email, and website 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

Answer
Comment
Array

Option : D
Explanation :

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

Report

Name

Email

Website

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

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

Comment

Name

Email

Website

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

Page 4 of 12« First «...2 345 6...10...»Last »

PRACTICE QUESTIONS
SHORT QUESTIONS
PREVIOUS YEAR SOLVED PAPERS

Related Quiz.
Regular Language Models

Login with Facebook

Login with Google

About

About Us
Contact Us

CATEGORIES

ACET
CS Foundation
Data Science
Deep Learning
CMAI Foundation
Machine Learning

Terms

Privacy Policy
Return Policy
Disclaimer
Feedback

Copyright © 2020 ™ is a registered trademark

Sign in
New account

Remember me

Forgot your password?

I agree with the Terms.

Lost your password? Please enter your email address. You will receive mail with link to set new password.