Lecture 10 Pumping Lemma
A property of regular sets
Weak version Strong version Applications
Pumping Lemma (weak)
If a language L is accepted by a DFA M with m states, then any string x in L with | x| > m can be written as x = uvw such that (1) v , and (
Lecture 9 Minimum DFA
For each regular language, there is a unique minimum DFA. How do we find it? Applications.
For each language L, how many DFA accepts L? Answer: infinity If we dont allow any useless state (i.e., a state not be visited), how many DF
Lecture 3 Graph Representation for Regular Expressions
digraph (directed graph)
A digraph is a pair of sets (V, E) such that each element of E is an ordered pair of elements in V. A path is an alternative sequence of vertices and edges such that all edge
Lecture 1 String and Language
string is a finite sequence of symbols. For example, string ( s, t, r, i, n, g) CS4384 ( C, S, 4, 3, 8) 101001 (1, 0) Symbols are given through alphabet. An alphabet is a finite set of symbols.
Examples of Alphabet