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: ECS 120 Lesson 1 – Alphabets, Languages and Grammars, Pt. 1 Oliver Kreylos Friday, March 30th, 2001 1 Outline Today’s lesson will lay the foundations for all further material in this class. It will supply the definitions and techniques needed in the next couple of lessons to define a formal language – as opposed to a natural language like English – and introduce methods of defining specific languages. It will also reinforce the mathematical techniques of recursive definition and induction. 2 Alphabets An alphabet Σ = { s 1 , s 2 , . . . , s n } is a nonempty, finite set of symbols, also called characters . Examples: • The latin alphabet { a , b , . . . , z , A , B , . . . , Z } . • The greek alphabet { α, β, . . . , ω, A , B , . . . , Ω } . • The ASCII set. • The Unicode set. 3 Words A word x over an alphabet Σ is the concatenation of a finite number of symbols from Σ. In programming language terms, a word is a string of char 1 acters. To handle words over an alphabet Σ mathematically, we recursivelyacters....
View
Full
Document
This note was uploaded on 05/20/2010 for the course ECS 120 taught by Professor Filkov during the Spring '07 term at UC Davis.
 Spring '07
 Filkov

Click to edit the document details