Set A
1. Write a C program to simulate a Deterministic Finite Automata (DFA) for the given language representing strings that start
with a and end with a
2. Design DFA using simulator to accept the input string “a” ,”ac”,and ”bac”.
3. Design PDA using simulator to accept the input string aabb
4. Design TM using simulator to accept the input string A^nB^n
AIM/ ALGORITHM (20) PROGRAM (40) OUTPUT (20) GITHUP (10) EXECUTION (10) TOTAL (100)
Set B
1. Write a C program to simulate a Deterministic Finite Automata (DFA) for the given language representing strings that
start with 0 and end with 1
2. Design PDA using simulator to accept the input string a^nb^2n
3. Design TM using simulator to accept the input string A^nB^n
4. Design DFA using simulator to accept the string start with a or b over the set {a,b}
AIM/ ALGORITHM (20) PROGRAM (40) OUTPUT (20) GITHUP (10) EXECUTION (10) TOTAL (100)
Set C
1. Write a C program to check whether a given string belongs to the language defined by a Context Free Grammar (CFG)
S → 0A1 A → 0A | 1A | ε
2. Design TM using simulator to accept the input string A^nB^2n
3. Design DFA using simulator to accept even number of a’s.
4. Design PDA using simulator to accept the input string a^nb^n
AIM/ ALGORITHM (20) PROGRAM (40) OUTPUT (20) GITHUP (10) EXECUTION (10) TOTAL (100)
Set D
1. Write a C program to find ℇ-closure for all the states in a Non-Deterministic Finite Automata (NFA) with ℇ-moves.
2. Design TM using simulator to perform addition of ‘aa’ and ‘aaa’
3. Design DFA using simulator to accept odd number of a’s
4. Design PDA using simulator to accept the input string a^nb^n
AIM/ ALGORITHM (20) PROGRAM (40) OUTPUT (20) GITHUP (10) EXECUTION (10) TOTAL (100)
Set E
1. Write a C program to check whether a given string belongs to the language defined by a Context Free Grammar (CFG)
S → 0S0 | 1S1 | 0 | 1 | ε
2. Design TM using simulator to accept the input string Palindrome ababa
3. Design DFA using simulator to accept the input string “a” ,”ac”,and ”bac”.
4. Design PDA using simulator to accept the input string aabb
AIM/ ALGORITHM (20) PROGRAM (40) OUTPUT (20) GITHUP (10) EXECUTION (10) TOTAL (100)
Set F
1) Write a C program to check whether a given string belongs to the language defined by a Context Free Grammar (CFG)
S → 0S0 | A A → 1A | ε
2) Design TM using simulator to perform addition of ‘aa’ and ‘aaa’
3) Design DFA using simulator to accept odd number of a’s
4) Design PDA using simulator to accept the input string a^nb^n
AIM/ ALGORITHM (20) PROGRAM (40) OUTPUT (20) GITHUP (10) EXECUTION (10) TOTAL (100)
Set G
1. Write a C program to check whether a given string belongs to the language defined by a Context Free Grammar (CFG)
S → 0S1 | ε
2. Design TM using simulator to perform subtraction of aaa-aa
3. Design DFA using simulator to accept the string the end with ab over set {a,b) : W= aaabab
4. Design PDA using simulator to accept the input string a^nb^n
AIM/ ALGORITHM (20) PROGRAM (40) OUTPUT (20) GITHUP (10) EXECUTION (10) TOTAL (100)
Set H
1. Write a C program to check whether a given string belongs to the language defined by a Context Free Grammar (CFG)
S → A101A A → 0A | 1A | ε
2. Design DFA using simulator to accept the input string “a” ,”ac”,and ”bac”.
3. Design PDA using simulator to accept the input string aabb
4. Design TM using simulator to accept the input string A^nB^n
AIM/ ALGORITHM (20) PROGRAM (40) OUTPUT (20) GITHUP (10) EXECUTION (10) TOTAL (100)
Set I
1. .Write a C program to simulate a Non-Deterministic Finite Automata (NFA) for the given language representing strings
that start with b and end with a
2. Design PDA using simulator to accept the input string a^nb^2n
3. Design TM using simulator to accept the input string A^nB^n
4. Design DFA using simulator to accept the string start with a or b over the set {a,b}
AIM/ ALGORITHM (20) PROGRAM (40) OUTPUT (20) GITHUP (10) EXECUTION (10) TOTAL (100)
Set J
1. Write a C program to simulate a Non-Deterministic Finite Automata (NFA) for the given language representing strings
that start with 0 and end with 1
2. Design TM using simulator to accept the input string A^nB^2n
3. Design DFA using simulator to accept even number of a’s.
4. Design PDA using simulator to accept the input string a^nb^n
AIM/ ALGORITHM (20) PROGRAM (40) OUTPUT (20) GITHUP (10) EXECUTION (10) TOTAL (100)
Set K
1. Write a C program to find ℇ-closure for all the states in a Non-Deterministic Finite Automata (NFA) with ℇ-moves.
2. Design TM using simulator to accept the input string Palindrome ababa
3. Design DFA using simulator to accept the input string “a” ,”ac”,and ”bac”.
4. Design PDA using simulator to accept the input string aabb
AIM/ ALGORITHM (20) PROGRAM (40) OUTPUT (20) GITHUP (10) EXECUTION (10) TOTAL (100)
Set L
1. Write a C program to find ℇ-closure for all the states in a Non-Deterministic Finite Automata (NFA) with ℇ-moves.
2. Design TM using simulator to perform addition of ‘aa’ and ‘aaa’
3. Design DFA using simulator to accept odd number of a’s
4. Design PDA using simulator to accept the input string a^nb^n
AIM/ ALGORITHM (20) PROGRAM (40) OUTPUT (20) GITHUP (10) EXECUTION (10) TOTAL (100)