Theory of Computation Automata Theory Dr. Ayman Srour.

Slides:



Advertisements
Similar presentations
4b Lexical analysis Finite Automata
Advertisements

CS 208: Computing Theory Assoc. Prof. Dr. Brahim Hnich Faculty of Computer Sciences Izmir University of Economics.
CSE 202 – Formal Languages and Automata Theory 1 REGULAR LANGUAGE.
Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong Fall 2009.
Theory Of Automata By Dr. MM Alam
Lecture 3UofH - COSC Dr. Verma 1 COSC 3340: Introduction to Theory of Computation University of Houston Dr. Verma Lecture 3.
Finite Automata Finite-state machine with no output. FA consists of States, Transitions between states FA is a 5-tuple Example! A string x is recognized.
Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong Fall 2008.
Introduction to the Theory of Computation John Paxton Montana State University Summer 2003.
Quantum Automata Formalism. These are general questions related to complexity of quantum algorithms, combinational and sequential.
CS 490: Automata and Language Theory Daniel Firpo Spring 2003.
A sample processing of an input molecule. S0 S1 a a b b A1: even number of b’s Automaton A1 accepting inputs with an even number of b ’s.
Topics Automata Theory Grammars and Languages Complexities
Grammars, Languages and Finite-state automata Languages are described by grammars We need an algorithm that takes as input grammar sentence And gives a.
1 Non-Deterministic Finite Automata. 2 Alphabet = Nondeterministic Finite Automaton (NFA)
Introduction to the Theory of Computation
Lecture # 1 (Automata Theory)
1 An Introduction to Formal Languages and Automata Provided by : Babak Salimi webAdd:
CSCI 2670 Introduction to Theory of Computing September 28, 2005.
CSCI 2670 Introduction to Theory of Computing August 24, 2005.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
REGULAR LANGUAGES.
AUTOMATA THEORY Reference Introduction to Automata Theory Languages and Computation Hopcraft, Ullman and Motwani.
1 Unit 1: Automata Theory and Formal Languages Readings 1, 2.2, 2.3.
By: Er. Sukhwinder kaur.  What is Automata Theory? What is Automata Theory?  Alphabet and Strings Alphabet and Strings  Empty String Empty String 
4b 4b Lexical analysis Finite Automata. Finite Automata (FA) FA also called Finite State Machine (FSM) –Abstract model of a computing entity. –Decides.
1 Theory of Computation 計算理論 2 Instructor: 顏嗣鈞 Web: Time: 9:10-12:10 PM, Monday Place: BL.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
Deterministic Finite Automata CS 130: Theory of Computation HMU textbook, Chapter 2 (Sec 2.2)
CS 208: Computing Theory Assoc. Prof. Dr. Brahim Hnich Faculty of Computer Sciences Izmir University of Economics.
Foundations of (Theoretical) Computer Science Chapter 2 Lecture Notes (Section 2.2: Pushdown Automata) Prof. Karen Daniels, Fall 2010 with acknowledgement.
Theory of Computing CSCI 356/541 Lab Session. Outline Lab 1: Finite Automata  Construct and Run Construct and Run  Manipulating Transitions Manipulating.
UNIT - I Formal Language and Regular Expressions: Languages Definition regular expressions Regular sets identity rules. Finite Automata: DFA NFA NFA with.
using Deterministic Finite Automata & Nondeterministic Finite Automata
CSE 202 – Formal Languages and Automata Theory 1 REGULAR EXPRESSION.
Theory of Computation Automata Theory Dr. Ayman Srour.
Theory of Computation Automata Theory Dr. Ayman Srour.
Theory of Computation Automata Theory Dr. Ayman Srour.
Computation Theory Asia Mahdi. Textbooks Programs, Machines and Computation: An Introduction to the Theory of Computing - Authors: Keith Clark and Don.
Developed by: JOHNNY FREESE WCED: METRO SOUTH EDUCATION DISTRICT WCED Metro South Education District Electricity An Introduction.
Theory of Computation. Introduction to The Course Lectures: Room ( Sun. & Tue.: 8 am – 9:30 am) Instructor: Dr. Ayman Srour (Ph.D. in Computer Science).
Theory of Computation Automata Theory Dr. Ayman Srour.
Theory of Computation Automata Theory Dr. Ayman Srour.
COMP 3438 – Part II - Lecture 3 Lexical Analysis II Par III: Finite Automata Dr. Zili Shao Department of Computing The Hong Kong Polytechnic Univ. 1.
Theory of Computation Automata Theory Dr. Ayman Srour.
Theory of Computation Automata Theory Dr. Ayman Srour.
Formal Foundations-II [Theory of Automata]
Natural Sciences and Technology Grade 6
Introduction to the Theory of Computation
Lexical analysis Finite Automata
CIS Automata and Formal Languages – Pei Wang
EE 1001 Digital Topics Introduction to Electrical Engineering
PROGRAMMING LANGUAGES
G. Pullaiah College of Engineering and Technology
CSC312 Automata Theory Chapter # 5 by Cohen Finite Automata
Finite Automata & Regular Languages
Natural Sciences and Technology Grade 6
Chapter 2 FINITE AUTOMATA.
Computer Science 210 Computer Organization
CSE322 Finite Automata Lecture #2.
COSC 3340: Introduction to Theory of Computation
4b Lexical analysis Finite Automata
4b Lexical analysis Finite Automata
CSC312 Automata Theory Chapter # 5 by Cohen Finite Automata
Chapter 1 Regular Language
Lecture One: Automata Theory Amjad Ali
Teori Bahasa dan Automata Lecture 6: Regular Expression
Formal Languages and Automata Theory BODDEDA HARITHA LAKSHMI,
Non Deterministic Automata
Automata theory and formal languages COS 3112 – AUTOMATA THEORY PRELIM PERIOD WEEK 1 AND 2.
Presentation transcript:

Theory of Computation Automata Theory Dr. Ayman Srour

TOPIC 2: REGULAR LANGUAGES OUTLINE 2.1 Introduction 2.2 Finite Automata 2.3 Nondeterminism 2.4 Regular Expressions 2.5 Generalized Nondeterministic Finite Automaton

2.1 Introduction Automata theory is the study of abstract computational devices Abstract devices are (simplified) models of real computations Computations happen everywhere: On your laptop, on your cell phone, in nature, … Why do we need abstract models?

2.1 Introduction A simple computer, example 1 BATTERY SWITCH input: switch output: light bulb actions: f for “flip switch” states: on, off

2.1 Introduction A simple computer, example 1 BATTERY SWITCH off on start f f input: switch output: light bulb actions: f for “flip switch” states: on, off

2.1 Introduction A simple computer, example 1 BATTERY off start inputs: switches 1 and 2 actions: 1 for “flip switch 1” actions: 2 for “flip switch 2” states: on, off bulb is on if and only if both switches were flipped an odd number of times off on

2.1 Introduction / These devices can model many things They can describe the operation of any “small computer”, like the control component of an alarm clock or a microwave They are also used in lexical analyzers to recognize well formed expressions in programming languages ab1 is a legal name of a variable in C 5u= is not