COMP 370 Midterm: Midterm Study Guide
14 Mar 2018
School
Department
Course
Professor
Document Summary
Midterm study guide: dfa, deterministic machine with 1 next possible state based on a given input symbol, formal definition i) Q (1) (2) (3) (4) (5: what does it mean for a dfa to accept a string? i) Given dfa if there exists a sequence of states m = ( . Q, and string r r0 1 2 r r n w = w1 such that w w n. , we say m accepts w r0 = q0 (1) (r , w ) Midterm study guide (a) power set of q = set of all subsets of q (b) transition function takes a state and input symbol or and produces the set of possible next states q0. = f (4) (5: what does it mean for a dfa to accept a string? i) Given nfa there exists a sequence of states.
