Download presentation

Presentation is loading. Please wait.

Published byHorace Lucas Modified over 2 years ago

1
RECAP CSE 318

2
Final Exam Cumulative: –Regular languages, automata: 20% –Context-free languages, pushdown automata: 20% –Turing machines, decidable, recognizable, nondecidable languages: 40% –(remaining 20%: flexibility)

3
Two Key Questions What is computation? –Non-deterministic computation What kinds of problems we can solve with computation? –limits of computation

4
Computation conf 1 trans 1 conf 2 trans 2 …. trans n conf n configurations transitions

5
Examples (s,100) (s,1,q) (q,00) ( q,0,p ) (f,e) ( p,0,f ) (p,0) Finite automata: (s,101,e) ((s,1,e),(q,*)) (q,01,*) (f,e,e)(p,1,*) Pushdown automata: ((q,0,e),(p,e)) ((p,1,*),(f,e)) (s,101) ((s,1,0),(q, )) (q,001) (f,010) Turing machines: ((q,0,1),(p, )) (p,011) ((p,1,0),(f, ))

6
Nondetermistic Computation Theoretical (i.e., artificial) construct that facilitates: Proving properties of computation Writing algorithms in a simplified form conf 1 trans 1 conf 2 Trans 1’ Conf 2’ ….

7
Configuration Finite automata ConfigurationMachine (state,string) Pushdown automata (state,string,stack) Turing machines (state,LShRS) LS,RS: strings, h:symbol A configuration indicate the current state of the computation

8
Transitions Finite automata TransitionMachine Pushdown automata Turing machines (state, symbol, state) ((state, symbol, pop), (state,push)) ((state, symbol, symbol), (state, / )) A transition indicates how the configurations are transformed

9
Notion of Acceptance Finite automata ConfigurationMachineAcceptance if (f,w) f: accepting state, w = e Pushdown automata (f,w, ) f: accepting state, w =e Turing machines (f, w) f: accepting state Acceptance indicates what kinds of configurations are considered successful computations

10
Machines versus Classes of Languages Machine Expressiveness Finite Automata Pushdown Automata Turing Machines Regular Languages Context-free Languages Decidable languages

11
Machine vs. n-stack NFA Machine n-stack NFA Finite Automata Pushdown Automata Turing Machines NFA + 0 stacks NFA + 1 stack NFA + 2 stacks

12
Computation and Countability Surprisingly deep connection If a language L can be enumerated then it is recognizable –To recognize if w is in L: 1.Print next string in L: 2.If w = w’ then accept else goto 1 And the other way around! Enumerator of L … w’

13
Problems that Can be Solved with Computation Church-Turing Thesis Algorithms = Turing machines Therefore, C, C++, Prolog, Lisp, Small talk, and Java programs can be simulated byTuring machines

14
Classes of Languages Regular languages Context-Free Languages Decidable Languages Recognizable Languages Non recognizable Languages Limits of computation Turing machines Pushdown Automata Finite Automata subset (Equivalence) (HALT) ({ww| w *}) (Palindrome) (a*b*) This is the end…

Similar presentations

OK

Grammars, Languages and Finite-state automata Languages are described by grammars We need an algorithm that takes as input grammar sentence And gives a.

Grammars, Languages and Finite-state automata Languages are described by grammars We need an algorithm that takes as input grammar sentence And gives a.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on paintings and photographs related to colonial period of america Oled flexible display ppt online Ppt on low power tv transmitter Ppt on polynomials and coordinate geometry practice Ppt on atrial septal defect symptoms Ppt on zener diodes Ppt on types of production process Ppt on asian continental Flexible display ppt on ipad Ppt on heritage of india