This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 452 Formal Languages and Automata Theory Summer 2004 Midterm Problems Problem 1. (22 pts) Consider the regular expression = ( a ab b ) . (a) (2 pts) Find strings u and v of length | u | = | v | = 7, such that u L ( ) and v / L ( ). (b) (10 pts) Construct a DFA that accepts the language L ( ) that is charac- terized by the regular expression . (c) (10 pts) Given some regular expression R , can you think of a method to come up with a regular expression R , such that L ( R ) = L ( R ) ? Use that method to build a regular expression that characterizes the lan- guage L ( ) = L ( ) for the regular expression given above. Problem 2. (35 pts) For each of the following languages decide whether it is a regular or a context free language or neither. If it is regular or context free show it by providing either a regular expression, a finite automaton ( DFA or NFA , your choice), a PDA , or a context free grammar that characterizes the language., or a context free grammar that characterizes the language....
View Full Document
This test prep was uploaded on 04/03/2008 for the course CS 456 taught by Professor Deftel during the Spring '08 term at Rutgers.
- Spring '08