Chapter1Section1_F11

Chapter1Section1_F11 - 91.304 Foundations of(Theoretical...

This preview shows pages 1–4. Sign up to view the full content.

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

View Full Document

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 91.304 Foundations of (Theoretical) Computer Science Chapter 1 Lecture Notes (Section 1.1: DFA’s) David Martin [email protected] uml edu [email protected] With some modifications by Prof. Karen Daniels, Fall 2011 This work is licensed under the Creative Commons Attribution-ShareAlike License. To view a copy of this license, visit http://creativecommons.org/licenses/by- 1 sa/2.0/ or send a letter to Creative Commons, 559 Nathan Abbott Way, Stanford, California 94305, USA. Chapter 1: Regular Languages ¡ Simple model of computation ¡ Input a string, and either accept or reject it ¢ Models a very simple type of function, a redicate on strings: predicate on strings: f : Σ * → {0,1} ee example of a tate- ansition ¢ See example of a state transition diagram 2 Syntax of DFA eterministic finite automaton (DFA) ¡ A deterministic finite automaton (DFA) is a 5-tuple (Q, Σ , δ ,q ,F) such that 1. is a finite et of states Q s a te set o states 2. Σ (“sigma”) is an alphabet ( finite set) 3. δ :Q × Σ → Q (“delta”) is the transition function 4. q ∈ Q (“q naught”) is the start state 5. F ⊆ Q is the set of accepting states sually these names are used but others...
View Full Document

This note was uploaded on 02/13/2012 for the course CS 91.304 taught by Professor Staff during the Fall '11 term at UMass Lowell.

Page1 / 12

Chapter1Section1_F11 - 91.304 Foundations of(Theoretical...

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

View Full Document
Ask a homework question - tutors are online