Presentation is loading. Please wait.

Presentation is loading. Please wait.

Lecture # 6 Theory Of Automata By Dr. MM Alam. Lecture#5 Recap Introduction to Finite Automata Finite Automata representation using Transition tables.

Similar presentations


Presentation on theme: "Lecture # 6 Theory Of Automata By Dr. MM Alam. Lecture#5 Recap Introduction to Finite Automata Finite Automata representation using Transition tables."— Presentation transcript:

1 Lecture # 6 Theory Of Automata By Dr. MM Alam

2 Lecture#5 Recap Introduction to Finite Automata Finite Automata representation using Transition tables and using graphs Finite Automata examples

3 1 a 0 0 b a,b

4 Given an input string, an FA will either accept or reject the input based on the following: – If final state is reached after reading the string, the FA will accept the string – If the final state is not reachable after reading the individual symbols of a string, then FA will reject the string.

5 Construct a regular expression and correspondingly an FA for all words in which a appears tripled, if at all. The regular expression is as follows:- (aaa+b)* 6 2 a a,b 1 - a b 3 5+ a b b 4+ a,b

6 Construct a regular expression and correspondingly an FA for all strings that end in a double letter. The regular expression is as follows:- (a+b)*(aa+bb) 3+ 1 a 1 - a b 2+ b a 4+ b a b a b

7 L 1 = The language of strings, defined over Σ={a, b}, beginning with b a,b b a –– +

8 1 The language of strings, defined over Σ={a, b}, not beginning with a. a,b 3 b a 1 1 +2

9 JLFAP provides a Hands-on Approach to Formal Languages and Automata. JLFAP = Java Formal Languages and Automata Package It is an Instructional tool to learn concepts of Formal Languages and Automata Theory Topics: – Regular Languages (Finite Automata, Regular Expressions etc.,) – Context-Free Languages and many more…

10 Lecture#6 Summary Finite Automata examples corrections JFLAP Introduction Practical Demonstration of JFLAP


Download ppt "Lecture # 6 Theory Of Automata By Dr. MM Alam. Lecture#5 Recap Introduction to Finite Automata Finite Automata representation using Transition tables."

Similar presentations


Ads by Google