Formulas Comp 481 George Yang CH 5---eps(state)= set of all states that can be reached through e transitions.

NDFSM = DFSM. Build an DFSM from NDFSM by having states whose labels are subsets of all the states. Equivalence classes of strings (reflexive, symmetric, transitive). Equivalence classes are partition. # eq classes = min. #states. #classes is finite. Exists unique min. machine for each DFSM. Minimize existing DFSM (collapse states or- overcluster into accepting/nonaccepting and split as required). CH 6 Regex = FSM. FSM from regex (tack together parts from each part of regex). Regex from FSM (rip out states and put in transitions that correspond to regex at that point. First add new start state and new accepting states). Regular languages closed under union/concatenation/star/intersection/complement. CH7 Regular grammars = regex = FSM. Rule is left hand = single nonterminal. Right hand = e/single terminal/single terminal followed by single nonterminal CH8 Pumping Theorem for Regular languages. If L is regular language then exist k such that for every string w in L, where |w| >=k, exists x,y,z such that w=xyz, |xy| <=k, y != e, and for all q >=0, xy^qz is in L. CH9 Given L is w in L? Simulate FSM on w. Given FSM is L(M) empty? Minimize M and see if any accepting states. Is L(M) totality? Check if complement machine is empty. Is L finite? Check all strings greater than or equal to the number of equivalence classes and less than 2* number 1 .Are minimal? Are equivalent? Minimize. Ch 11Grammar= nonterminal -> right hand side. Ambiguity. Eliminate e-rules. Eliminate symmetric recursive rules. Chomsky normal form= nonterminal->single terminal. Nonterminal -> 2 nonterminals. Convert to ChomskyRemoveEPS. Remove unit production. Remove mixed. Remove long. CH 12 CFG = PDA. DPDA != PDA. Top-down + bottom up parsing.Read input and shift it onto stack. When stack matches a rule pop it off and replace. Every PDA is equivalent to a PDA with only 2 states. There is no minimal PDA. M doesnt necessarily halt on any w, and DPDA != PDA. Theres no minimal PDA either ( and not closed under complement) CH 13 Pumping theorem for CFL= If L is CF, exists k such that for all w in L with |w| > k , exists uvxyz such that w = uvxyz, vy!=e, |VXY| <= k , for all q>=0 uv^qxy^qz is in L. CFL closed under Union, concatenation, Kleene star, reverse, letter substitution. Nonclosed under intersection/complement/difference. Closed under intersection and difference with regular languages. DCFL use end of string marker. Have DPDA. Closed under complement. Not closed under union/intersection. Every DCFL has an unambiguous grammar.