CSC4510 AUTOMATA
2.4 The Pumping Lemma
2.5 How to Build a Simple Computer
Using Equivalence Classes
2.6 Minimizing the Number of States
in a Finite Automaton
The Pumping Lemma
Suppose that M = (Q, , q0, A, ) is an FA accepting L
and that it has n states.
CSC4510 AUTOMATA
3.1 Regular Languages and Regular
Expressions
3.2 Nondeterministic Finite Automata
Regular Languages and Regular Expressions
Example languages:
Strings ending in aa: cfw_a, b*cfw_aa
(This is a simplification of (cfw_acfw_b)*cfw_acfw_a)
CSC4510 AUTOMATA
4.4 Derivation Trees and Ambiguity
4.5 Simplified Forms and Normal
Forms
Derivation Trees and Ambiguity
Derivation Tree:
Root node: start variable S.
Interior node and its children: production A
Leaf node: a symbol or .
Every deri
CSC4510 AUTOMATA
4.1 Using Grammar Rules to Define a
Language
4.2 Context-Free Grammars: Definitions
and More Examples
4.3 Regular Languages and Regular
Grammars
Using Grammar Rules to Define a Language (contd.)
A grammar is a set of rules, by which stri
CSC4510 AUTOMATA
2.2 Accepting the Union, Intersection,
or Difference of Two Languages
2.3 Distinguishing One String from
Another
Accepting the Union, Intersection, or Difference of Two Languages
Suppose that L1 and L2 are languages over
Given an FA th