This preview shows page 1. Sign up to view the full content.
Unformatted text preview: | aAcc A → bAc | bc 3. (Sudkamp 3.14 page 84) For each of the following regular grammars, give a regular expression for the language generated by the grammar. a) S → aA A → aA | bA | b a ( a ∪ b ) * b b) S → aA A → aA | bB B → bB | λ a + b + c) S → aS | bA A → bB B → aB | λ a * bba * d) S → aS | bA | λ A → aA | bS ( a + ( ba * b ∪ λ )) *...
View Full Document
This note was uploaded on 09/26/2011 for the course TOC 1345 taught by Professor Joe during the Spring '11 term at HDM Stuttgart.
- Spring '11