CIS 262 Fall 2013: Homework 4, Due Monday, Sept 30
Please write your answers succinctly, rigorously, and using a word-processor. Submit
2 separate unstapled sheets, one for each problem, each with you
CIS 262 Fall 2013: Homework 3, Due September 24
Please write your answers succinctly and rigorously. Write answers to each of the
problems on separate sheets, and submit 2 separate unstapled sheets ea
CIS 262 Fall 2010: Midterm 1, October 14, 12.001.20pm
You are allowed to consult your class notes, class handouts, and the textbook.
1. Let = cfw_a, b, c. A string w belongs to the language L precisel
CIS 262 Fall 2013: Homework 8, Due November 21
Please write your answers succinctly and rigorously using a word processor. Submit two separate unstapled sheets each with your name and problem number c
CIS 262 Fall 2010: Midterm 1 Solutions
Problem 1
Let = cfw_a, b, c. A string w belongs to the language L precisely when w contains at least one a
symbol and does not contain any b symbols.
The followi
CIS 262 Fall 2013: Solutions to Homework 9
Problem 1
Consider Double-Sat: cfw_ | is a Boolean formula with at least two distinct satisfying assignments.
Prove that Double-Sat is NP-complete.
We rst pr
CIS 262 Fall 2015: Homework 1, Due September 8, 12 Noon
Problem 1 (6pts)
This problem involves designing DFAs that accept a variety of specied languages using the online
tool AutomataTutor designed fo
CIS 262 Fall 2015: Homework 6, Due Tuesday, October 27
Please write your answers succinctly and rigorously. Write each of the answers on
separate sheets: submit two separate sheets each with your name
CIS 262 Fall 2015: Homework 9, Due December 1
Please write your answers succinctly and rigorously. Submit two separate unstapled
sheets each with your name and problem number clearly written by 12 noo
CIS 262 Fall 2015: Homework 10, Due December 8
Please write your answers succinctly and rigorously. Submit two separate unstapled
sheets each with your name and problem number clearly written by 12 no
CIS 262 Fall 2015: Homework 7, Due November 3
Please write your answers succinctly and rigorously. Write each of the answers
on separate sheets: submit three separate sheets each with your name and pr
CIS 262
Automata, Computability, and Complexity
Fall 2015
http:/www.seas.upenn.edu/~cse262/
Instructor: Rajeev Alur
[email protected]
Lecture: Oct 22, 2015
Decision problems about DFAs are decidable
CIS 262
Automata, Computability, and Complexity
Fall 2015
http:/www.seas.upenn.edu/~cse262/
Instructor: Rajeev Alur
[email protected]
Lecture: Nov 10, 2015
Recap: Part B: Computability Theory
ALL LAN
CIS 262
Automata, Computability, and Complexity
Fall 2015
http:/www.seas.upenn.edu/~cse262/
Instructor: Rajeev Alur
[email protected]
Lecture: Dec 1, 2015
Time vs. Space Complexity
A TM/program M has
CIS 262
Automata, Computability, and Complexity
Fall 2015
http:/www.seas.upenn.edu/~cse262/
Instructor: Rajeev Alur
[email protected]
Lecture: Nov 24, 2015
NP-Complete Problems
A problem A is called
CIS 262
Automata, Computability, and Complexity
Fall 2015
http:/www.seas.upenn.edu/~cse262/
Instructor: Rajeev Alur
[email protected]
Lecture: Nov 19, 2015
Recap: The class NP
A language L is in NP i
CIS 262
Automata, Computability, and Complexity
Fall 2015
http:/www.seas.upenn.edu/~cse262/
Instructor: Rajeev Alur
[email protected]
Lecture: Sept 24, 2015
Proving Non-regularity
To prove that a lan
CIS 262
Automata, Computability, and Complexity
Fall 2016
http:/www.seas.upenn.edu/~cse262/
Instructor: Aaron Roth
[email protected]
Lecture: Nov 1, 2016
Undecidability of Non-emptiness Problem for
CIS 262 Fall 2015: Homework 2 Solutions
Problem 1
(a) Initial state is q0,0
(b) Drawing a picture similar to part (a) with (.)s was also accepted. Important to note states, transition
function, initia
018 262 Fall 2015: Solutions to Homework 5
Problem 1
MM) = 01*.
The start state of the Turing machine (TM) is go. Since there is no transition deﬁned on 1 from (13, the ﬁrst
ght. If the second symbol
CIS 262
Automata, Computability, and Complexity
Fall 2015
http:/www.seas.upenn.edu/~cse262/
Instructor: Rajeev Alur
[email protected]
Lecture: Oct 15, 2015
Recap: Core Definitions
A language L is a s
CIS 262
Automata, Computability, and Complexity
Fall 2015
http:/www.seas.upenn.edu/~cse262/
Instructor: Rajeev Alur
[email protected]
Lecture: Oct 6, 2015
Part B: Computability
Alan Turing (British m
CIS 262
Automata, Computability, and Complexity
Fall 2015
http:/www.seas.upenn.edu/~cse262/
Instructor: Rajeev Alur
[email protected]
Lecture: Oct 20, 2015
NTM Summary
Given an NTM M, there exists an
CIS 262 Practice Final
1. Consider the following language defined over = cfw_0, 1:
L = cfw_0m 1n | m is an integer multiple of n.
Is L regular? Prove your answer.
Solution: No, L is not regular. Assum