1 . Introduction To Automata Theory And Formal Languages
2 . Equivalence Of Nfa And Dfa
3 . Operations On Languages
4 . Regular Expressions And Languages
5 . Closure Properties Of Regular Languages
6 . Decision Algorithms
7 . Properties Of Regular Sets (Languages)
8 . Exampleof Non Deterministic Finite Automata
9 . Two-way Finite Automata
10 . Myhill-nerode Theorem
11 . Finite Automata
12 . Deterministic Finite State Automaton (Dfa)
13 . Languages
14 . Grammar
15 . Relations And Functions
16 . Sets
17 . Machines
18 . Graphs
19 . Asymptotic Behavior Of Functions
20 . Regular Expressions
21 . Kleene Star, ‘∗’
22 . Conversion Of Nfa To Dfa
23 . Nondeterministic Finite Automaton
24 . Mealy And Moore Machine
25 . Strings And Languages
26 . Boolean Logic
27 . Homomorphism
28 . Machine Types That Accept Non-regular Languages
29 . Orders For Strings
30 . Pumping Lemma
31 . Nfa With ε-Moves
32 . Nfas To Regular Expression
33 . Myhill-nerode Theorem-1
34 . Building Regular Expressions
35 . The Power Of Dfas
36 . Finite Automata With Output
37 . Simplification Of Cfg
38 . Properties Of Context-free Languages
39 . A Pumping Lemma For Cfls
40 . Execution Of Npda
41 . Equivalence (Preorder Plus Symmetry)
42 . Transitive, And Related Notions
43 . Greibach Normal Form
44 . A Pumping Lemma For Cfls
45 . Right- And Left-linear Cfgs
46 . Relation Between Pda And Context Free Language
47 . Proof Of Pumping Lemma
48 . Error-correcting Dfas
49 . Ultimate Periodicity And Dfas
50 . Usage Of Pumping Lemma
51 . Developing Cfgs
52 . The Power Relation Between Machines
53 . Derivation Tree
54 . Conversion Of Left-linear Grammar Into Right-linear Grammar
55 . Pushdown Automata
56 . Introduction To Context-free Grammars
57 . Parsing
58 . Dicision Algorithms
59 . Cfg To Npda
60 . Normal Forms
61 . Npda To Cfg
62 . Binary Relation Basics
63 . Ambiguity
64 . Introduction To Push-down Automata
65 . A Taxonomy Of Formal Languages And Machines
66 . Transition Functions For Npda
67 . Stabilization At A Fixed-point
68 . Dealing With Recursion
69 . The Y Operator
70 . The Least Fixed-point
71 . The Automaton/logic Connection
72 . Basic Operations On Bdds
73 . Binary Decision Diagrams (Bdds)
74 . Logical Inference
75 . Context Sensitive Grammar And Languages
76 . Boolean Satisfiablity
77 . Quantifiers And Logical Operators
78 . Additional Np Problem
79 . Logical Identities
80 . Propositions
81 . Normal Forms
82 . Composition And Recursion
83 . Formal Systems
84 . Predicates And Quantifiers
85 . Connectives
86 . The Chomsky Hirarchy
87 . Polynomial Time Algorithm
88 . Unrestricted Grammar
89 . Introduction To Complexity Theory
90 . Tautology, Contradiction And Contingency
91 . Ackermann's Theorem
92 . Encoding Conventions
93 . Conversion Algorithm: Presburger Formulas To Automata
94 . Halting Problem
95 . Post’s Correspondence Problem (Pcp)
96 . Reactive Computing Systems
97 . Examples Of Interpretations
98 . Buchi Automata, And Verifying Safety And Liveness
99 . First-order Logic (Fol) And Validity
100 . Greibach’s Theorem
101 . Axiomatization Of Propositional Logic
102 . Presburger Formulas And Dfas
103 . Temporal Logics
104 . Dfa For Presburger Arithmetic
105 . Ltl Vs. Ctl Through An Example
106 . Dimacs File Encoding
107 . Model (Proctype) And Property (Never) Automata
108 . Properties Of Boolean Formulas
109 . Acceptance, Halting, Rejection
110 . Computations Vs. Computation Trees
111 . Cnf-conversion Using Gates
112 . Pitfalls To Avoid
113 . Pcp Is Undecidable
114 . Ctl Syntax
115 . Basic Undecidability Proofs
116 . Temporal Formulas Are Kripke Structure Classifiers
117 . Simulations Of Turing Machine
118 . Ndtms
119 . Validity Of First-order Logic Is Undecidable
120 . Model Checking Vs. Testing
121 . An Introduction To Model Checking
122 . 3-cnf, =-Satisfiability, And General Cnf
123 . Dining Philosophers
124 . Basic Notions In Logic Including Sat
125 . 2-cnf Satisfiability
126 . Overview Of Direct Dnf To Cnf Conversion
127 . Unsatisfiable Cnf Instances
128 . Proof Sketch Of The Undecidability Of Pcp
129 . Rice’s Theorem
130 . Enumerating Strings In A Language
131 . Turing Machine
132 . Programming A Turing Machine
133 . Church-turing Thesis
134 . Complete Language And Functions
135 . Modification Of Turing Machines
136 . Rice's Theorem
137 . Turing Machines As Transducers
138 . Ltl Syntax