DVA325FormalLanguages,AutomataandTheoryofComputation,MlardalenUniversitySchoolofInnovation,DesignandEngineering,
Finalexam18Jan2013
REGULARLANGUAGES(14POINTS)
Problem1(6points)ForthefollowingNFA(Sudkamp)
a
q0
b
a
q1
a
q2
c
a)Writethetransitionfunctionande

Automata Theory - Midterm (Solutions)
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
cfw_ksmani@csee.wvu.edu
1 Problems
1. Professor Chikovski wants to prove the conjecture, If B then C. After working for four hours, he succeeds in
proving t

Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by Ca

Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by CamScanner
Scanned by Ca

Assignment 2
September 1, 2016
Q1. Let A be a DFA and q a particular state of A, such that (q, a) = q for
all input symbols a. Show by induction on the length of the input that for all
input string w, (q, a) = q.
(q,w)
Q2. Give DFAs accepting the followin

Theory of Computing
Assignment 1
September 1, 2016
1. Let f be a relations from R+ to R with f defined as f (x) = x where R+
is the set of all positive real numbers and R is the set of all real number.
Is f a function? If yes, prove it. If not give a coun

Department of CSE
The LNM IIT, Jaipur
Theory of Computation [CSE-331]
Year: 3rd
Credits: 03
Programme: B.Tech. (CSE)
Course: Core
Semester: 6th
Hours: 40
Course Context and Overview (100 words):
The objective of this course is to introduce students to thi