Notecards:
CSCI 320
Notation
Finite State Machines
Minimal FSM
Non-Deterministic Finite State Machines
Regular Expressions
Pumping Lemma For Regular Languages
Languages
Grammars
Parse Trees
Pumping Lemma For Context Free Languages
Chomsky Normal Form
Push Down Automata
Turing Machines
Universal Turing Machines
Non-Recursive Languages
Complexity Classes
Finite State Machines
Prev | Top | Next
Minimal FSM
Prev | Top | Next
Non-Determinisitc Finite State Machines
Prev | Top | Next
Regular Expressions
Prev | Top | Next
Pumping Lemma For Regular Languages
Prev | Top | Next
Languages
Correction:
recursive enumerable if there is a TM that accepts it
recursive if there is a TM that recognizes it
Prev | Top | Next
Parse Trees
Prev | Top | Next
Pumping Lemma For Context-Free Languages
Prev | Top | Next
Chomsky Normal Form
Prev | Top | Next
Push Down Automata
Prev | Top | Next
Turing Machines
Prev | Top | Next
Universal Turing Machines
Prev | Top | Next
Non-Recursive Languages
Prev | Top | Next
Complexity Classes
Prev | Top | Next
Course:
Foundations Of Computer Science
Code:
CSCI 320
School:
Malaspina University-College
Teacher:
Dominique Roelants
Semester:
Spring 2007
Textbook:
None