CS360 Lecture 8: CS 360 Lecture 8 (Winter 2018)
30 Jan 2018
School
Department
Course
Professor
Document Summary
Gods@ ( an b) u ( a-a b) also regular . following w a and regular , )h = zhtl last symbol is 1] the. Hence using language of exponentially subset construction to is equivalent more. A dfa symbols to recognize it reads . Lcn ) needs to remember the last n the last n - symbols ie reads then. If it ie can doesn"t become remember confused . a , dfiait , boi bit , an bn 0 " iy a- We can also consider of subsets the z* That are grammars ( cfgs ) to describe. Cfgs are used to specify programming languages building compilers for programming languages . languages . and are used in. G= ( v , 2 , r , set of variables s ) where is a. R is a finite finite set of terminals non. Sev is the variable of alphabet ) of the rules or set.
