Presentation is loading. Please wait.

Presentation is loading. Please wait.

Dept. Computer Science, Korea Univ. Intelligent Information System Lab. A I (Artificial Intelligence) Professor I. J. Chung.

Published byLaureen Barton Modified over 8 years ago

Similar presentations

Presentation on theme: "Dept. Computer Science, Korea Univ. Intelligent Information System Lab. A I (Artificial Intelligence) Professor I. J. Chung."— Presentation transcript:

1 Dept. Computer Science, Korea Univ. Intelligent Information System Lab. A I (Artificial Intelligence) Professor I. J. Chung

2 Dept. Computer Science, Korea Univ. Intelligent Information System Lab. AI (Artificial Intelligence)

3 Dept. Computer Science, Korea Univ. Intelligent Information System Lab. AI (Artificial Intelligence) Finite control …BB… Input tape

4 Dept. Computer Science, Korea Univ. Intelligent Information System Lab. AI (Artificial Intelligence)

5 Dept. Computer Science, Korea Univ. Intelligent Information System Lab. AI (Artificial Intelligence) 01XYB

6 Dept. Computer Science, Korea Univ. Intelligent Information System Lab. AI (Artificial Intelligence) 0 Ѣ X --- --- a.s. r.s.

7 Dept. Computer Science, Korea Univ. Intelligent Information System Lab. AI (Artificial Intelligence) … f.c. state p

8 Dept. Computer Science, Korea Univ. Intelligent Information System Lab. AI (Artificial Intelligence)

9 Dept. Computer Science, Korea Univ. Intelligent Information System Lab. AI (Artificial Intelligence) Type o language CSL CFL RL

10 Dept. Computer Science, Korea Univ. Intelligent Information System Lab. AI (Artificial Intelligence) Languages, Automata, Grammar LanguageAutomataGrammar RL(Regular Language)FSA(Finite State Automata)RG CFL(Context Free Language) PDA(Push Down Automata)CFG CSL(Context Sensitive Language) LBS(Linear Bounded Automata) CSG Typeless Language(type O Language) TM(Turing Machine)Typeless grammar

11 Dept. Computer Science, Korea Univ. Intelligent Information System Lab. AI (Artificial Intelligence) Note: FSA DFA NFA PDA DPDA NPDA TM DTM NTM

12 Dept. Computer Science, Korea Univ. Intelligent Information System Lab. AI (Artificial Intelligence) Note: Equivalence of deterministic automata and non-deterministic automata AutomataEquivalence DFA and NFA?Why? DPDA and NPDA?Why? DTM and NTM?Why?

13 Dept. Computer Science, Korea Univ. Intelligent Information System Lab. AI (Artificial Intelligence)

14 Dept. Computer Science, Korea Univ. Intelligent Information System Lab. AI (Artificial Intelligence) 01 0, 1 1

15 Dept. Computer Science, Korea Univ. Intelligent Information System Lab. AI (Artificial Intelligence) 3)b. Find a DFA for the following NFA. (i.e. convert the following NFA into an equivalent DFA) 0 0, 1 1

16 Dept. Computer Science, Korea Univ. Intelligent Information System Lab. AI (Artificial Intelligence) Solution: 01 0, 1 1 0 0 0 1 1

Download ppt "Dept. Computer Science, Korea Univ. Intelligent Information System Lab. A I (Artificial Intelligence) Professor I. J. Chung."

Similar presentations

CSC 361NFA vs. DFA1. CSC 361NFA vs. DFA2 NFAs vs. DFAs NFAs can be constructed from DFAs using transitions: Called NFA- Suppose M 1 accepts L 1, M 2 accepts.

CSC 361NFA vs. DFA1. CSC 361NFA vs. DFA2 NFAs vs. DFAs NFAs can be constructed from DFAs using transitions: Called NFA- Suppose M 1 accepts L 1, M 2 accepts.
Lecture 6 Nondeterministic Finite Automata (NFA)

Lecture 6 Nondeterministic Finite Automata (NFA)
Pushdown Automata Section 2.2 CSC 4170 Theory of Computation.

Pushdown Automata Section 2.2 CSC 4170 Theory of Computation.
Recap CS605: The Mathematics and Theory of Computer Science.

Recap CS605: The Mathematics and Theory of Computer Science.
Applied Computer Science II Chapter : Grammars Prof. Dr. Luc De Raedt Institut für Informatik Albert-Ludwigs Universität Freiburg Germany.

Applied Computer Science II Chapter : Grammars Prof. Dr. Luc De Raedt Institut für Informatik Albert-Ludwigs Universität Freiburg Germany.
Courtesy Costas Busch - RPI1 Non Deterministic Automata.

Courtesy Costas Busch - RPI1 Non Deterministic Automata.
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.

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.
1 3 1 0 start 0, 4, 8 1, 5, 9 2, 6 3, 7 2 0,4,8 2, 6 3, 7 1, 5, 9 to state 2 to state 3 to state 1 to state 0 to state 1 to state 3 to state 0 to state.

start 0, 4, 8 1, 5, 9 2, 6 3, 7 2 0,4,8 2, 6 3, 7 1, 5, 9 to state 2 to state 3 to state 1 to state 0 to state 1 to state 3 to state 0 to state.
Fall 2006Costas Busch - RPI1 Non-Deterministic Finite Automata.

Fall 2006Costas Busch - RPI1 Non-Deterministic Finite Automata.
1 Non-Deterministic Automata Regular Expressions.

1 Non-Deterministic Automata Regular Expressions.
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.

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.
Fall 2004COMP 3351 Another NFA Example. Fall 2004COMP 3352 Language accepted (redundant state)

Fall 2004COMP 3351 Another NFA Example. Fall 2004COMP 3352 Language accepted (redundant state)
Fall 2003Costas Busch - RPI1 Turing Machines (TMs) Linear Bounded Automata (LBAs)

Fall 2003Costas Busch - RPI1 Turing Machines (TMs) Linear Bounded Automata (LBAs)
PZ03A Programming Language design and Implementation -4th Edition Copyright©Prentice Hall, 2000 1 PZ03A - Pushdown automata Programming Language Design.

PZ03A Programming Language design and Implementation -4th Edition Copyright©Prentice Hall, PZ03A - Pushdown automata Programming Language Design.
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.
1 Pushdown Automata PDAs. 2 Pushdown Automaton -- PDA Input String Stack States.

1 Pushdown Automata PDAs. 2 Pushdown Automaton -- PDA Input String Stack States.
1 Non-Deterministic Finite Automata. 2 Alphabet = Nondeterministic Finite Automaton (NFA)

1 Non-Deterministic Finite Automata. 2 Alphabet = Nondeterministic Finite Automaton (NFA)
Final Exam Review Cummulative Chapters 0, 1, 2, 3, 4, 5 and 7.

Final Exam Review Cummulative Chapters 0, 1, 2, 3, 4, 5 and 7.
Cs3102: Theory of Computation Class 6: Pushdown Automata Spring 2010 University of Virginia David Evans TexPoint fonts used in EMF. Read the TexPoint manual.

Cs3102: Theory of Computation Class 6: Pushdown Automata Spring 2010 University of Virginia David Evans TexPoint fonts used in EMF. Read the TexPoint manual.
Saeid Pashzadeh Jan 2009 Theory of Computation 1.

Saeid Pashzadeh Jan 2009 Theory of Computation 1.

Similar presentations

Ads by Google