Help shape GoConqr. What should we add next?

Flashcards

Theory of Computation

Jabber Jabbs Computer Science English 14 cards

The Acceptance Relation

Cards in this deck (14)

  1. 1ScienceScience
  2. 2EngineeringEngineering
  3. 3Church-Turing-Post ThesesChurch-Turing-Post Theses
  4. 4Deterministic Finite AutomataDeterministic Finite Automata
  5. 5The Acceptance RelationThe Acceptance Relation
  6. 6Language Accepted by an DfaLanguage Accepted by an Dfa
  7. 7Regular LanguageRegular Language
  8. 8Nondeterministic Finite AutomataNondeterministic Finite Automata
  9. 9The Acceptance Relation (NFA)The Acceptance Relation (NFA)
  10. 10Regular ExpressionRegular Expression
  11. 11Theorem (Closure of Regular Languages)Theorem (Closure of Regular Languages)
  12. 12Theorem (Equivalence of NFA's and DFA's)Theorem (Equivalence of NFA's and DFA's)
  13. 13Theorem(Pumping Lemma for Regular Languages)Theorem(Pumping Lemma for Regular Languages)
  14. 14—

Information

Description
Theory of Computation Flashcards Lecture 1-3
Created by
Jabber Jabbs
Views
52
Rating

More on Automata and Computability

Feedback

What is it about?

What should we add next?