Search

Keine Ergebnisse

Wort	Foliensatz	Folie	Treffer

Decks (26)

	Deck
1	ECS 120 Theory of Computation — Strings, Languages, and Finite Automata `01b_StringsAndDFAs-deck.html`
2	ECS 120 Theory of Computation — DFA Formal Definitions and Examples `01c_DFAComputation-deck.html`
3	ECS 120 Theory of Computation — Regular expressions and introduction to context-free grammars `02a_Regex-deck.html`
4	ECS 120 Theory of Computation — Context-Free Grammars `02b_CFG-deck.html`
5	ECS 120 Theory of Computation — Nondeterministic Finite Automata `02c_NFA-deck.html`
6	ECS 120 Theory of Computation — Closure of Language Classes and Algorithms on Automata `03a_ClosureOfLanguages-deck.html`
7	ECS 120 Theory of Computation — Closure of NFA-decidable Languages, the Proofs `03b_NFAClosureProofs-deck.html`
8	ECS 120 Theory of Computation — Equivalence of Computational Models `03c_Equivalence-deck.html`
9	ECS 120 Theory of Computation — Equivalence of Regular Grammars and DFAs `04a_RG_DFA_Equivalence-deck.html`
10	ECS 120 Theory of Computation — Equivalence of Regular Expressions and NFAs `04b_Regex_NFA_Equivalence-deck.html`
11	ECS 120 Theory of Computation — Nonregular Languages `04c_NonregularLanguages-deck.html`
12	ECS 120 Theory of Computation — Nonregular Languages Pt. 2 `05a_NonregularLanguages_pt2-deck.html`
13	ECS 120 Theory of Computation — Turing Machines `05b_TuringMachines-deck.html`
14	ECS 120 Theory of Computation — Turing Machines: Computation and Variants `05c_TuringMachineComputation-deck.html`
15	ECS 120 Theory of Computation — Asymptotic analysis `07a_Asymptotic_analysis-deck.html`
16	ECS 120 Theory of Computation — The Time Hierarchy Theorem and the Complexity Class P `07b_TimeHierarchyAndClassP-deck.html`
17	ECS 120 Theory of Computation — Problems in P `07c_P_and_NP-deck.html`
18	ECS 120 Theory of Computation — Time Complexity Class NP `08a_NP-deck.html`
19	ECS 120 Theory of Computation — NP-Completeness and Reductions `08b_NP-Completeness-deck.html`
20	ECS 120 Theory of Computation — NP-Completeness and Reductions, Pt 2 `08c_NP-CompletenessPt2-deck.html`
21	ECS 120 Theory of Computation — NP Hardness, NP Completeness, and Reductions, Pt 3 `09a_NP_CompletenessPt3-deck.html`
22	ECS 120 Theory of Computation — Undecidability `09b_Undecidability-deck.html`
23	ECS 120 Theory of Computation — Undecidability: More Undecidable Problems `09c_UndecidabilityPt2-deck.html`
24	ECS 120 Theory of Computation — Sizes of Sets `10a_SizesOfSets-deck.html`
25	ECS 120 Theory of Computation — Diagonalization and Undecidability of the Halting Problem `10b_DiagonalizationHalting-deck.html`
26	ECS 120 Theory of Computation — Week 1 Discussion: Discrete Math Review `Discussion_01-deck.html`