HM4-FSMsAndRegEXs-Ch7-Closure

HM4-FSMsAndRegEXs-Ch7-Closure - a) pref ( L ) = { w : 5 x *...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 341 Automata Theory Elaine Rich Homework 4 Due: Thursday, February 8, 2007 1) Consider the following FSM M : a a b 1 b 2 a 3 b 4 a,b a) Show a regular expression for L ( M ). b) Describe L ( M ) in English. 2) Consider the following FSM M : q 0 a q 1 b q 3 b a b q 2 a) Write a regular expression that describes L ( M ). b) Show a DFSM that accepts ¬ L ( M ). 3) Show a regular grammar for each of the following languages: a) { w { a , b }* : w does not end in aa }. b) { w { a , b }* : w does not contain the substring aabb }. 4) Consider the following regular grammar G : S a T T b T T a T a W W ε W a T a) Write a regular expression that generates L ( G ). b) Use grammartofsm to generate an FSM M that accepts L ( G ). 5) Prove by construction that the regular languages are closed under: a) intersection. b) set difference. 6) Prove that the regular languages are closed under each of the following operations:
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: a) pref ( L ) = { w : 5 x * ( wx L )}. b) suff ( L ) = { w : 5 x * ( xw L )}. c) reverse(L) = { x * : x = w R for some w L }. d) letter substitution (as defined in Section 8.3). 7) Using the definitions of maxstring and mix given in Section 8.6, give a precise definition of each of the following languages: a) maxstring (A n B n ). b) maxstring ( a i b j c k , 1 k j i ). c) maxstring ( L 1 L 2 ), where L 1 = { w { a , b }* : w contains exactly one a } and L 2 = { a }. d) mix (( aba )*). e) mix ( a * b *)....
View Full Document

This note was uploaded on 12/03/2009 for the course CS 341 taught by Professor Rich during the Fall '08 term at University of Texas at Austin.

Page1 / 2

HM4-FSMsAndRegEXs-Ch7-Closure - a) pref ( L ) = { w : 5 x *...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online