Review - Numerical Functions • Recursive Sets •...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
REVIEW REVIEW
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
REGULAR LANGUAGE REGULAR LANGUAGE Deterministic Finite Automata Nondeterministic Finite Automata Finite Automata and Regular Expressions Languages that are and are not regular State Minimization
Background image of page 2
CONTEXT-FREE LANGUAGES CONTEXT-FREE LANGUAGES Context-free grammars Parse trees Pushdown automata Pushdown automata and context-free grammars Languages that are and are not context-free
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
TURING MACHINES TURING MACHINES The definition of a Turing machine Computing with Turing machines
Background image of page 4
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Numerical Functions • Recursive Sets • Recursively Enumerable (RE) Sets • Nondeterministic TMs • General Grammars UNDECIDABLE UNDECIDABLE • Chuch-Turing Thesis • Universal Turing Machine • Halting Problem COMPLEXITY COMPLEXITY • Measuring Complexity • Asymptotic Analysis • Big-O • Analyzing Algorithms • Time Complexity Class • Class P • Polynomial Time • Class NP • Nondeterministic Time • NP -Complete THANKS THANKS & & GOOD LUCK! GOOD LUCK!...
View Full Document

This note was uploaded on 01/23/2012 for the course CS 220 taught by Professor Xiaogangjin during the Spring '09 term at Zhejiang University.

Page1 / 7

Review - Numerical Functions • Recursive Sets •...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online