Dept. of Computer Science & IT, FUUAST Automata Theory 2 Automata Theory II B Q.For  = {a, b} construct DFA that accepts all strings with exactly one.

Slides:



Advertisements
Similar presentations
4b Lexical analysis Finite Automata
Advertisements

CSE 105 Theory of Computation Alexander Tsiatas Spring 2012 Theory of Computation Lecture Slides by Alexander Tsiatas is licensed under a Creative Commons.
Regular Expressions and DFAs COP 3402 (Summer 2014)
CSE 202 – Formal Languages and Automata Theory 1 REGULAR LANGUAGE.
Transparency No. 2-1 Formal Language and Automata Theory Homework 3.
Finite Automata CPSC 388 Ellen Walker Hiram College.
Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin CS CS 4384 – HON001 Automata Theory
Dept. of Computer Science & IT, FUUAST Automata Theory 2 Automata Theory VII.
Applied Computer Science II Chapter 1 : Regular Languages Prof. Dr. Luc De Raedt Institut für Informatik Albert-Ludwigs Universität Freiburg Germany.
Intro to DFAs Readings: Sipser 1.1 (pages 31-44) With basic background from Sipser 0.
Intro to DFAs Readings: Sipser 1.1 (pages 31-44) With basic background from Sipser 0.
Lecture 3UofH - COSC Dr. Verma 1 COSC 3340: Introduction to Theory of Computation University of Houston Dr. Verma Lecture 3.
CSC 3130: Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong Regular.
Homework #2 Solutions.
Introduction to the Theory of Computation John Paxton Montana State University Summer 2003.
CS5371 Theory of Computation Lecture 6: Automata Theory IV (Regular Expression = NFA = DFA)
CS5371 Theory of Computation Lecture 4: Automata Theory II (DFA = NFA, Regular Language)
1.Defs. a)Finite Automaton: A Finite Automaton ( FA ) has finite set of ‘states’ ( Q={q 0, q 1, q 2, ….. ) and its ‘control’ moves from state to state.
Lecture 5UofH - COSC Dr. Verma 1 COSC 3340: Introduction to Theory of Computation University of Houston Dr. Verma Lecture 5.
Regular Languages A language is regular over  if it can be built from ;, {  }, and { a } for every a 2 , using operators union ( [ ), concatenation.
Dept. of Computer Science & IT, FUUAST Automata Theory 2 Automata Theory III Languages And Regular Expressions Construction of FA’s for given languages.
Basics of automata theory
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
Theory of Computation, Feodor F. Dragan, Kent State University 1 Regular expressions: definition An algebraic equivalent to finite automata. We can build.
2. Scanning College of Information and Communications Prof. Heejin Park.
4b 4b Lexical analysis Finite Automata. Finite Automata (FA) FA also called Finite State Machine (FSM) –Abstract model of a computing entity. –Decides.
CSCI 2670 Introduction to Theory of Computing September 1, 2005.
Finite Automata – Definition and Examples Lecture 6 Section 1.1 Mon, Sep 3, 2007.
CMSC 330: Organization of Programming Languages Theory of Regular Expressions Finite Automata.
Theory of Computing CSCI 356/541 Lab Session. Outline Lab 1: Finite Automata  Construct and Run Construct and Run  Manipulating Transitions Manipulating.
Brian K. Strickland a ba Λ a aa b Λ -NFA for Regular Expression (aab)*(a + aba)*
Finite Automata Chapter 1. Automatic Door Example Top View.
Lecture 2 Overview Topics What I forgot from last lecture Proof techniques continued Alphabets, strings, languages Automata June 2, 2015 CSCE 355 Foundations.
Recap: Transformation NFA  DFA  s s1s1... snsn p1p1 p2p2... pmpm >...  p1p1  p2p2  pipi s e s1s1 e s2s2 e sisi >
Mathematical Foundations of Computer Science Chapter 3: Regular Languages and Regular Grammars.
using Deterministic Finite Automata & Nondeterministic Finite Automata
Nondeterministic Finite Automata (NFAs). Reminder: Deterministic Finite Automata (DFA) q For every state q in Q and every character  in , one and only.
Dept. of Computer Science & IT, FUUAST Theory of Computation 2 Regular Expressions Regular Expression.
 2004 SDU Lecture4 Regular Expressions.  2004 SDU 2 Regular expressions A third way to view regular languages. Say that R is a regular expression if.
CSE 202 – Formal Languages and Automata Theory 1 REGULAR EXPRESSION.
Theory of Computation Automata Theory Dr. Ayman Srour.
1 Section 11.2 Finite Automata Can a machine(i.e., algorithm) recognize a regular language? Yes! Deterministic Finite Automata A deterministic finite automaton.
Deterministic Finite Automata Nondeterministic Finite Automata.
1 1. Eliminate all  -transitions from the following FA without changing the number of states and the language accepted by the automaton. You should also.
Dept. of Computer Science & IT, FUUAST Automata Theory 2 Automata Theory III Properties of Regular Languages 1.Closure 2.Union 3.Concatenation 4.Complement(Negation)
Page 1. 1)Let B n = { a k | where k is a multiple of n}. I.e. B 1 = { a k | where k is a multiple of 1} = { a k | k Є {0,1,2,3,…}} = {‘’, a, aa, aaa, aaaa,
1/29/02CSE460 - MSU1 Nondeterminism-NFA Section 4.1 of Martin Textbook CSE460 – Computability & Formal Language Theory Comp. Science & Engineering Michigan.
Theory of Languages and Automata By: Mojtaba Khezrian.
Deterministic Finite-State Machine (or Deterministic Finite Automaton) A DFA is a 5-tuple, (S, Σ, T, s, A), consisting of: S: a finite set of states Σ:
PROGRAMMING LANGUAGES
Foundations of Computing Science
Formal Language & Automata Theory
Lexical analysis Finite Automata
PROGRAMMING LANGUAGES
Formal Language & Automata Theory
AUTOMATA THEORY VI.
Examples for Finite Automata
Regular Expressions Prof. Busch - LSU.
Deterministic Finite Automata And Regular Languages Prof. Busch - LSU.
Non-Deterministic Finite Automata
COSC 3340: Introduction to Theory of Computation
CS 350 — Fall 2018 gilray.org/classes/fall2018/cs350/
CSE322 Minimization of finite Automaton & REGULAR LANGUAGES
Finite Automata.
4b Lexical analysis Finite Automata
Homework #5 (Models of Computation, Spring, 2001) Due: Section 1; February 27 Section 2; February 28 ** Please put your homework in the collection.
4b Lexical analysis Finite Automata
Chapter 1 Regular Language
NFAs and Transition Graphs
Non Deterministic Automata
Presentation transcript:

Dept. of Computer Science & IT, FUUAST Automata Theory 2 Automata Theory II B Q.For  = {a, b} construct DFA that accepts all strings with exactly one ‘a’. A.

Dept. of Computer Science & IT, FUUAST Automata Theory 3 Automata Theory II B Q.For  = {a, b} construct DFA that accepts all strings with at least one ‘a’. A.

Dept. of Computer Science & IT, FUUAST Automata Theory 4 Automata Theory II B Q.For  = {a, b} construct DFA that accepts all strings with no more than three a’s. A.

Dept. of Computer Science & IT, FUUAST Automata Theory 5 Automata Theory II B Q.For  = {a, b} construct DFA that accepts all strings with at least one ‘a’ and exactly two b’s. A.

Dept. of Computer Science & IT, FUUAST Automata Theory 6 Automata Theory II B Q.Determine a DFA that accepts all strings on {0, 1} except those containing the substring 001. A.

Dept. of Computer Science & IT, FUUAST Automata Theory 7 Automata Theory II B Q.Obtain the NFA for a language defined by L = {a n b m | n,m  1} A.

Dept. of Computer Science & IT, FUUAST Automata Theory 8 Automata Theory II B Q.Construct an NFA for the state table given below. A.

Dept. of Computer Science & IT, FUUAST Automata Theory 9 Automata Theory II B Q.Obtain the language recognized by the NDA shown below. A. L = { 0 n, 0 n 01, 0 n 11 | n  0

Dept. of Computer Science & IT, FUUAST Automata Theory 10 Automata Theory II B Q.Determine the DFA that accepts the language L(aa* + aba* + b*) A.

Dept. of Computer Science & IT, FUUAST Automata Theory 11 Automata Theory II B Q.Determine the DFA that accepts the language L(ab(a + ab*(a + aa))) A.

Dept. of Computer Science & IT, FUUAST Automata Theory 12 Automata Theory II B Q.Determine the regular expression for the language accepted by the following automaton. A. L = b*.aa*.ab*.a

Dept. of Computer Science & IT, FUUAST Automata Theory 13 Automata Theory II B Q.Determine the regular expression for the language accepted by the following automaton. A. L = (aabb)* + b(bab)*.(ba)*b + (ab)*

Dept. of Computer Science & IT, FUUAST Automata Theory 14 Automata Theory II B Q.Determine the regular expression for the language accepted by the following automaton. A. L = a*.ba*