Theory of Automata and Formal Languages BS 5 Semester/Term UOS — University of Sargodha 2015
Discussion
Ask a question about this paper, or help someone else with theirs. Answers are emailed to whoever asked.
No questions yet — be the first to ask.
Need a paper or stuck on a question? Ask here — students reply and you get an email.
Ask about a paper-
BS ZOOLOGY first semester Animal diversity ZOOL 101 - university of Punjab 2025
0 replies Reply → -
Literary criticism
1 reply Reply → -
this paper consists of 60 marks but now we have 35 marks paper.
1 reply Reply → -
Can you please tell me more past papers please because my exams are starting from next week
1 reply Reply → -
Did you provide the past papers of the science of society uos?
1 reply Reply →
More Theory of Automata and Formal Languages papers
See all
Theory of Automata and Formal Languages MS Computer Science/MSc Computer Science/PhD Computer Science Islamia University Bhawalpur (IUB) 2017
Uploaded 3 years ago
Download ↓
Theory of Automata and Formal Languages BS/MPhil Computer Science/MS Computer Science 5 Semester/Term University Of Sargodha (UOS) 2017
Uploaded 3 years ago
Download ↓
Theory of Automata and Formal Languages M.Sc. 3 Semester/Term Islamia University Bhawalpur (IUB) 2015
Uploaded 3 years ago
Download ↓
Theory of automata and Formal Languages MSCS 2018 IUB
Uploaded 3 years ago
Download ↓
Theory of Automata and Formal Language BSCS 2015 UOS
Uploaded 3 years ago
Download ↓
Theory of Automata and Formal Language BSCS 2016 UOS
Uploaded 3 years ago
Download ↓
Paper text
University of Sargodha
BS(CS), 5th Term Exam 2015
Time Allowed: 2:30 Hrs
Paper: Theory of Automats & Formal Languages (C1:211)
Max. Marks: 60
Objective Part (Compalsory)
Q.No.J. Write short answers for the following questions. (16x2-32)
1. What is the Principle of Mathematical Induction?
* Define Regular Languages?
* What is a Regular Expression? Shortly discuss it with an example?
4. What is a Finite Automata? Shortly discuss it with an example?
Which language, this regular expresson (00+01 + 10+11)* presents?
6. Define NFA with an example?
* Give an example of an NFA accepting (0)(1)"
a Define A-Closure of a set of states regarding NFA.
9: Define Non-regular languages?
I. What does PDA mean? Provide an example?
A. Define Context Free Grammars?
Y2. Define Chomsky's Normal form?
43. Discuss Turing Machines shortly with an example?
14. What is Minimal Finite Automata?
15. What is Universal Turing Machines?
1G, What does Context Sensitive Grammar mean?
Subjective Part
Gx16m45）
Note: Attempt any o3 questions.
Q.No.2. Provide regular expressions of the following. where I - (0.1):.
Strings of length six or less
11.
Strings with Next-to-Last symbol is 0
Strings ending with O
iv.
Strings with even number of O's and odd number of I's
Q.No.3. If Li™ (a, ab) and La" (ab) then find the Union, Intersection and Complement
between Ly and Lj. Also draw their respective nutomats and explain each step properly
(0,1)"(10)
iv.
Strings containing either ab or bha
Q.No.5. Convert the following NFA to DFA using Subset Construction Method, where
Q4 is the accepting state.
Q.No.6. Prove that the language I. = 1ª% is a non-regular Innguage, where n ≥ 0.
