Automata Are Essential for the study of the limits of intrrence: Dicidability and intractability.
2 Important Notations That Play An Important Role in Automata:
1) GRAMMARS Are Useful Models When Designing Software That Proceses Data With A Recursive Structure. EXAMPLE: PARSER.
2) Regular Expressions Denote The Structure of Data.
2 Kinds of Proof:
1) Deducitve Kind, Using A Sequence of Justified Steps
2) INDUCTIVE KIND, Recursive Proof of a parameterized statement That Use The Statement Itself with The Lower "Value" of the paramter.
