JB Institute of Technology
Campus : 23 Milestone , NH-07 , Shankarpur , Chakrata Road
Dehradun (UK) - INDIA
B.TECH AI-ML 5 Sem
Question paper set: Set-01 CST-009
Question paper name : Formal Languages and Automata Theory Total Question : 9
Time : 2 Hours To Be Attempted : 6
Maximmum Marks : 30
First internal exam ODD semester 2024-25
Section - A Total Question 3 To be attempted : 2
Attempt any two.
[CO01] [RBT 3]
1 Define an alphabet, a string, and a language. Provide examples to illustrate each concept M.M. :5
[CO01] [RBT 3]
2 Construct a DFA that accepts the language of all strings over the alphabet {0, 1} that end with "01". M.M. :5
[CO01] [RBT 6]
3 Design a DFA that recognizes the language of all strings over the alphabet {a, b} where the number M.M. :5
of 'a's is exactly 3.
Section - B Total Question 3 To be attempted : 2
Attempt any two.
[CO02] [RBT 3]
1 Convert the following NFA to DFA shown in Figure 1. M.M. :5
[CO02] [RBT 3]
2 Convert the following NFA to DFA shown in Figure. M.M. :5
[CO02] [RBT 3]
3 Convert the following NFA to DFA shown in Figure. M.M. :5
Section - C Total Question 3 To be attempted : 2
Attempt any two.
[CO03] [RBT 6]
1 Construct a DFA for the language L over the alphabet {0, 1} where L consists of all strings that M.M. :5
contain the substring "101"
[CO03] [RBT 1]
2 Construct a DFA for the language L over the alphabet {0, 1} where L consists of all strings where M.M. :5
the number of 1's is even.
[CO03] [RBT 6]
3 Construct a DFA that accepts all strings over the alphabet {0, 1} that start with a '1' and end with a M.M. :5
'0'.
