tailieunhanh - Lecture note Theory of automata - Lecture 30

Lecture Theory of automata - Lecture 30 includes contents: Deciding whether two languages are equivalent or not, example, deciding whether an FA accept any string or not, method 3, examples, finiteness of a language. | Lecture # 6 Theory Of Automata By Dr. MM Alam 1 Lecture#5 Recap Introduction to Finite Automata Finite Automata representation using Transition tables and using graphs Finite Automata examples 1 a 0 b a,b 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. 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 a, b 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 L1 = The language of strings, defined over Σ={a, b}, beginning with b a,b b a a,b –– + 1 The language of . | Lecture # 6 Theory Of Automata By Dr. MM Alam 1 Lecture#5 Recap Introduction to Finite Automata Finite Automata representation using Transition tables and using graphs Finite Automata examples 1 a 0 b a,b 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. 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 a, b 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 L1 = The language of strings, defined over Σ={a, b}, beginning with b a,b b a a,b –– + 1 The language of strings, defined over Σ={a, b}, not beginning with a . a,b 3 a,b b a 1 +2 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 Lecture#6 Summary Finite Automata examples corrections JFLAP Introduction Practical Demonstration of .