CDM
Boolean Decision Diagrams
Klaus Sutner
Carnegie Mellon University
Fall 2014
Outline
1
Minimal Automata
2
Binary Decision Diagrams
2
Challenge
Is there an implementation for Boolean functions that makes it easy to decide
equivalence?
Obviously there ar

15-354: Computational Discrete Math
Assignment 7
K. Sutner
Due: October 30, 2014
1 Counting Minimal 1-Letter DFAs (30)
Background
It is rather dicult to determine the number of minimal n-state DFAs up to isomorphism for alphabets of
size larger than 1. Re

15-354: Computational Discrete Math
Assignment 6
K. Sutner
Due: October 23, 2014
Problem 1: Nonstandard Arithmetic (30 pts.)
Background
We showed in class that the Peano axioms in rst-order logic are not enough to pin down the
standard model of arithmetic

CDM
Automata on Innite Words
Klaus Sutner
Carnegie Mellon University
Fall 2014
Outline
1
Presburger Arithmetic
2
Determinizing Bchi Automata
u
3
Safras Algorithm
2
MSO on Innite Words
3
We can dene a notion of word W satises formula W |= for an innite
wor