STAT 101 Lecture 12: Automata Theory, note 1
Document Summary
Write the elements of language ab. (6) language = {a, b, c} let a = {a, ab}. Write the elements of language a 3 (7) how many languages are there on ={a,b,c} (8) two languages on ={0,1,2}. Write the elements of language l1l2. (9) two languages on = {0, 1, 2} l1 = {00, 01, 02}, l2 = . Write the elements of language l1l2. (11) define the inverse of the word x inductively. base: When the length of x is 0, inverse of x= is r = . When the length of x is 1, the inverse of x = a is a r =a induction: When the length of x is 2 or more x = ay. where a is a symbol and y is a suffix of x. x r = (ay) r = y r a (12) prove that l * l = l l *.
