Log in Join

Home / Computer Science

ATC 21CSE53 Question Bank GLOBAL ACADEMY OF TECHNOLOGY
An Autonomous Institute, Affiliated to VTU Belagavi,
2023-24.pdf Approved by AICTE, Accredited by NAAC,'A' Grade,
Ideal Homes Township, Rajarajeshwari Nagar, Bengaluru - 560 098
School
Global Academy of Technology* Department of Computer Science and Engineering
(Accredited by NBA 2022-2025)
*We are not endorsed by this school
Academic Year 2023-24
Course
CS 21CSE52 Question Bank
Pages Course Name Automata Theory and Computability
14 and Code 21CSE53
Semester 5 A,
Course Course
Upload Date Instructors
KKY, RCR
Co-ordinator
VM

Jan 21, 2024 Module 1

Uploaded by DoctorBatMaster774 on coursehero.com
1. Define the following terms with suitable examples
2 Helpful Unhelpful
Related Computer Science • Alphabet • Substring

Documents •
•
Power of an Alphabet
String
•
•
Proper substring
Prefix
• Length of a string • Suffix
• Concatenation of two strings • Language
• Reversal of a string • Functions of a language
Page 1 of 14
2. Define Deterministic Finite Automata (DFA).

Designing DFA
PDFmyURL converts web pages and even full websites to PDF easily and quickly.
 Designing DFA
10.
11.
3. L = { waaDFA
Design
Design DFA
{0, 1}*
to accept
to accept
: w has
the
strings
001
following
stringsasof
ofsubstring
0's having
a's and
Language
1's
} atleast
havingone
three
'a'.consecutive 0's
4. Design a DFA to accept strings of a's and b's having atleast one 'a'
5. Design a DFA to accept strings of a's and b's having exactly one 'a'
6. Design a DFA to accept strings of a's and b's starting with the substring 'ab'
7. Design a DFA to accept strings of a's and b's ending with the substring 'abb'
8. Design a DFA to accept strings of a's and b's that do not end with the substring 'abb'
9. Design a DFA to accept strings of a's and b's ending with the substring 'ab' or 'ba'

12. Design a DFA to accept the following Language

L = { awa | w  {a, b}n where n ≥ 0 }
13. Design a DFA to accept strings of 0's and 1's such that the string contains odd numbe
14. Design a DFA to accept strings of 0's and 1's such that the string contains even numb
15. Design a DFA to accept strings of 0's, 1's and 2's such that the string begins with '0', f
odd number of 1's and ends with '2'
16. Design a DFA to accept strings of a's and b's having four a's.
17. Design a DFA to accept the following Language
L = { w where |w| mod 3 = 0 having ∑ = {a, b} }
18. Design a DFA to accept the following Language
L = { w where |w| mod 5 != 0 having ∑ = {a, b} }
19. Design a DFA to accept the following Language
L = { w where w is even number having ∑ = {a, b} }
20. Design a DFA to accept strings of a's, b's and c's such that the string contains even nu
21. Design a DFA to accept strings made up of the letters in the word 'chariot' and recogn
strings that contain the word 'cat' as the substring.
22. Design a DFA to read L = { w  {0, 1}* : w has odd parity }
23 D i
PDFmyURL converts web pages and even full websites to PDF easily and quickly. DFA t t ti f ' d b' h th t ' 'i i di t l f ll
 23.
27.
28.
29. Design aa DFA
DFAforto accept strings of a's and0's
b'sand
such that every 'a'
ofofis }immediately follow
30. Design DFA toL={w:
accept|w|
even
modnumber
3≠ = |w|ofmod 22;where
odd
even
wherenumber
wnumber
w{a,b}*
{a,b}* 1's.
1's.
24. Design a DFA to accept strings of a's and b's such that no two consecutive characters
31. Design DFA for L={w: |w| mod 3 > |w| mod 2; where w {a,b}* }
25. Design a DFA to accept odd number of 0's and odd number of 1's.
32. Design DFA for L={w: |w| mod 3 < |w| mod 2; where w {a,b}* }
26. Design a DFA to accept odd number of 0's and even number of 1's.

Divisible by k problems
33. Design a DFA to accept binary strings which are divisible by 5.
(Examples: 0, 0101, 1010, 1111 etc)
34. Design a DFA to accept decimal strings which are divisible by 3.
(Examples: 0, 3, 6, 9, 12 etc)

Conversion of NFA to DFA

35. Define NFA with an example.
36. Convert the given NFA to equivalent DFA

PDFmyURL converts web pages and even full websites to PDF easily and quickly.
 37. Convert the given NFA to equivalent DFA

38. Convert the given NFA to equivalent DFA

  0 1
→A {B}  {A, D}
B {D} {C} 
*C   {F}
D  {E} 
*E {F, C}  {B}
*F  {E} 

39. Convert the given NFA to equivalent DFA

PDFmyURL converts web pages and even full websites to PDF easily and quickly.
 Uploaded by DoctorBatMaster774 on coursehero.com

RESOURCES SUBJECTS
Study Guides Accounting Aerospace Engineering Anatomy
Study Documents Anthropology Arts & Humanities Astronomy
LEGAL Biology Business Chemistry
Copyright, Community Guidelines, DSA & other Legal Resources Civil Engineering Computer Science Communications
Honor Code Economics Electrical Engineering English
Terms Finance Geography Geology
Academic Integrity Health Science History Industrial Engineering
Privacy Policy Information Systems Law Linguistics
Cookie Policy Management Marketing Material Science
Do not Sell or Share My Personal Info Mathematics Mechanical Engineering Medicine
Nursing Philosophy Physics
Political Science Psychology Religion
Sociology Statistics

PDFmyURL converts web pages and even full websites to PDF easily and quickly.
 SOCIAL

© Learneo, Inc. 2024 *College Sidekick is not sponsored or endorsed by any college or university.

PDFmyURL converts web pages and even full websites to PDF easily and quickly.