Department of Computer Science
University of San Francisco
Computer Science 411
Homework 1: Sets
Due Friday, September 4th, 2015
1. (9 points) Enumerate each of the following sets (that is, write our all elements of each
of the following sets). Careful so
Automata Theory
CS411-2015S-12
Turing Machine Modifications
David Galles
Department of Computer Science
University of San Francisco
12-0:
Extending Turing Machines
When we added a stack to NFA to get a PDA, we
increased computational power
Can we do the s
Automata Theory
CS411-2015F-08
Context-Free Grammars
David Galles
Department of Computer Science
University of San Francisco
08-0:
Context-Free Grammars
Set of Terminals ()
Set of Non-Terminals
Set of Rules, each of the form:
<Non-Terminal> <Terminals &
N
Automata Theory
CS411-2015F-14
Counter Machines & Recursive Functions
David Galles
Department of Computer Science
University of San Francisco
14-0:
Counter Machines
Give a Non-Deterministic Finite Automata a
counter
Increment the counter
Decrement the cou
Automata Theory
CS411-2015F-13
Unrestricted Grammars
David Galles
Department of Computer Science
University of San Francisco
13-0:
Language Hierarchy
Regular
Languaes
Regular Expressions
Finite Automata
Context Free
Languages
Context-Free Grammars
Push-Do
Automata Theory
CS411-2015F-11
Turing Machines
David Galles
Department of Computer Science
University of San Francisco
11-0:
Turing Machines
Machines so far (DFA, PDA) read input only once
Next: Turing Machines
Can back up over the input
Can overwrite the