This preview shows pages 1–6. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1 Module 14 • Regular languages – Inductive definitions – Regular expressions • syntax • semantics 2 Regular Languages (Regular Expressions) 3 Regular Languages • New language class – Elements are languages • We will show that this language class is identical to LFSA – Language class to be defined by Finite State Automata (FSA) – Once we have shown this, we will use the term “regular languages” to refer to this language class 4 Inductive Definition of Integers * • Base case definition – 0 is an integer • Inductive case definition – If x is an integer, then • x+1 is an integer • x1 is an integer • Completeness – Only numbers generated using the above rules are integers 5 Inductive Definition of Regular Languages • Base case definition – Let Σ denote the alphabet – {} is a regular language – { λ } is a regular language – {a} is a regular language for any character a in Σ • Inductive case definition – If L 1 and L 2 are regular languages, then...
View
Full
Document
This note was uploaded on 07/25/2008 for the course CSE 460 taught by Professor Torng during the Fall '07 term at Michigan State University.
 Fall '07
 TORNG

Click to edit the document details