Scribd
Upload
36 views3 pages

ATCD Assignment 1-2024

IMPORTANT QUESTION

Uploaded by

Mohd Mushtaq Talikoti
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
36 views3 pages

ATCD Assignment 1-2024

IMPORTANT QUESTION

Uploaded by

Mohd Mushtaq Talikoti
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Shanti Vardhak Education Society’s

Bheemanna Khandre Institute Of Technology


Dept. of CSE, Bhalki
Assignment 1(Finite Automata)
Sub: ATCD Staff: Vishal More

1. Define the following terms with Examples


i. Alphabets v. Deterministic Finite Automata (DFA)
ii. String vi. Non-deterministic Finite Automata (NFA)
iii. Language vii. Epsilon NFA(ε-NFA)
iv. Finite Automata(FA)
viii. Power set
2. Construct DFA to accept the string of 1's and 0's ends with 00
3. Construct DFA to accept even number of 0's and even number of 1's
4. Construct DFA to accept even number of 0's and odd number of 1's
5. Construct DFA to accept odd number of 0's and even number of 1's
6. Construct DFA to accept odd number of 0's and odd number of 1's
7. Design DFA to accept the string of a's and b's such that string ends with aa and check the
string aaaa, abaaa and bbbaabaa accept or not
8. Design DFA to accept the string of a's and b's starting with the string ab
9. Design DFA to accept the string of a's and b's ending with the string abb
10. Design DFA to accept the string of a's and b's which do not end with the string abb
11. Design DFA to accept the string of a's and b's ending with the string ab or ba
12. Design DFA to accept the string of 0's, 1's and 2's beginning with ‘0’ followed by odd
number of 1's and ending with a '2'
13. Construct DFA to check whether the given number is divisible by 3
14. Design a DFA to accept the binary numbers which are divisible by 5. (0000, 0101, 1010 etc)
15. Obtain a DFA to accept the string of a's and b's such that each block of 5 consecutive
symbols have at least two a’s.
16. Obtain a DFA to accept the string of a's and b's such that the number of a’s is divisible by 5
and number of b’s is divisible by 3.

17. Difference between NFA, ε-NFA and DFA.


18. Obtain a DFA to accept the language L={w | w|mod3=0 } on ∑={a,b}
19. Design NFA to recognize the fallowing set of strings.

1
a. abc, abd, aadb
b. 0101, 101, 011
c. L={ababn, abam | n≥0 and m≥0}

20. Convert NFA to DFA.

21. Convert NFA to DFA.

22. Convert NFA to DFA.

23. Convert NFA to DFA.

2
3

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy