Cardinality with Applications to Computability Lecture 33 Section 7.5 Wed, Apr 12, 2006.
CSE 311 Foundations of Computing I Lecture 25 Pattern Matching, Cardinality, Computability Spring...
-
Upload
julius-anthony -
Category
Documents
-
view
216 -
download
0
description
Last Lecture Highlights DFAs ≡ Regular Expressions – No need to know details of NFAs→RegExpressions Method for proving no DFAs for languages – e.g. {0 n 1 n : n ≥ 0}, {Palindromes}, {Balanced Parens} How FSMs/DFAs are used in designing circuits – This was just to give a rough idea 3