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