Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Course Code: CSI-562 Course Name: Theory of Automata and Formal Lnguages Term: Final
Time Allowed: 1:40 min Marks: 20 Class: BSCS 5th Semester
1. L → a | b | La | Lb | L0 | L1
2. F → L | (E)
3. T → F | T ∗ F
4. E → T | E + T
Above Grammar is Ambiguous or Not for string a+a*a? Show from parse Tree.
Q. 3.a) What is Mealy Machine? Construct Mealy machine for adding binary numbers. 2+2=04
1. P?DA 2. Palindrom
“Best of Luck”
Paper B
Course Code: CSI-562 Course Name: Theory of Automata and Formal Lnguages Term: Final
Time Allowed: 10 min Marks: 10 Class: BSCS 5th Semester
A) ACCEPT and REJECT B) ACCEPT and READ C) ACCEPT AND START D) ACCEPT AND WRITE
iv) The symbols that can’t be replaced by anything are called -----------------
A) Productions B) Terminals C) Non-terminals D) All of above
v) The symbols that must be replaced by other things are called __________
A) Productions B) Terminals C) Non-terminals D) All of above
vii) The terminals are designated by ________ letters, while the non-terminals are designated by
________ letters.
A) Capital, bold B) Small, capital C) Capital, small D) Small, bold
viii) The language generated by __________ is called Context Free Language (CFL).
A) FA B) CFG C) TG D) TGT
“Best of Luck”