Search

Keine Ergebnisse

Wort	Foliensatz	Folie	Treffer

Decks (27)

	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 DFA-decidable and NFA-decidable Languages `03b_ClosureOfDFANFA-deck.html`
8	ECS 120 Theory of Computation — Closure of NFA-decidable Languages, the Proofs `03b_NFAClosureProofs-deck.html`
9	ECS 120 Theory of Computation — Equivalence of computational models `03c_Equivalence-deck.html`
10	ECS 120 Theory of Computation — Equivalence of RRGs, NFAs, and regex’s `04a_RG_DFA_Equivalence-deck.html`
11	ECS 120 Theory of Computation — Nonregular Languages `04b_NonregularLanguages-deck.html`
12	ECS 120 Theory of Computation — Turing Machines `04c_TuringMachines-deck.html`
13	ECS 120 Theory of Computation — Turing machine variants `05a_TuringMachineVariant-deck.html`
14	ECS 120 Theory of Computation — Asymptotic analysis `05b_Asymptotic_analysis-deck.html`
15	ECS 120 Theory of Computation — Asymptotic analysis (cont’d) and time complexity `05c_Asymptotic_analysis-contd-TimeIntro-deck.html`
16	ECS 120 Theory of Computation — Problems in P `06a_P_and_NP-deck.html`
17	ECS 120 Theory of Computation — Time Complexity Class NP `07a_NP-deck.html`
18	ECS 120 Theory of Computation — NP-Completeness and Reductions `07b_NP-Completeness-deck.html`
19	ECS 120 Theory of Computation — NP-Completeness and Reductions, Pt 2 `07c_NP-CompletenessPt2-deck.html`
20	ECS 120 Theory of Computation — NP Completeness and Reductions, Pt 3 `08a_NP_CompletenessPt3-deck.html`
21	ECS 120 Theory of Computation — NP Completeness and Reductions, Pt 4 `08b_NP_CompletenessPt4-deck.html`
22	ECS 120 Theory of Computation — Undecidability `08c_Undecidability-deck.html`
23	ECS 120 Theory of Computation — Undecidability: More Undecidable Problems `09a_UndecidabilityPt2-deck.html`
24	ECS 120 Theory of Computation — Sizes of Sets `09b_SizesOfSets-deck.html`
25	ECS 120 Theory of Computation — Sizes of Sets: Part 2 `09c_SizesOfSetsPt2-deck.html`
26	ECS 120 Theory of Computation — Diagonalization and Undecidability of the Halting Problem `10a_DiagonalizationHalting-deck.html`
27	ECS 120 Theory of Computation — Week 1 Discussion: Discrete Math Review `Discussion_01-deck.html`