Flashcards
Theory of Computation

Cards in this deck (14)
- 1Science

- 2Engineering

- 3Church-Turing-Post Theses

- 4Deterministic Finite Automata

- 5The Acceptance Relation

- 6Language Accepted by an Dfa

- 7Regular Language

- 8Nondeterministic Finite Automata

- 9The Acceptance Relation (NFA)

- 10Regular Expression

- 11Theorem (Closure of Regular Languages)

- 12Theorem (Equivalence of NFA's and DFA's)

- 13Theorem(Pumping Lemma for Regular Languages)

- 14—
Information
- Description
- Theory of Computation Flashcards Lecture 1-3
- Created by
- Jabber Jabbs
- Views
- 52
- Rating
More on Automata and Computability