TAILIEUCHUNG - Lecture note Theory of automata - Lecture 14

This chapter presents the following content: Examples of Kleene’s theorem part III (method 1) continued, Kleene’s theorem part III (method 2: Concatenation of FAs), examples of Kleene’s theorem part III (method 2: concatenation FAs) continued, Kleene’s theorem part III (method 3: closure of an FA), examples of Kleene’s theorem part III (method 3: Closure of an FA) continued. | Lecture # 23 Theory Of Automata By Dr. MM Alam 1 1 Lecture#22 Recap . Introduction to Context Free Grammars How a High Level language is converted to low level instructions, that computer understand. What are Production Rules and Derivations What is a CFG CFG Examples JFLAP for CFG Context Free Language Example 3 Let the terminals be a and b, the only nonterminal be S, and Productions PROD 1 S → aS PROD 2 S → bS PROD 3 S → a PROD 4 S →b 3 Context Free Language Example 3 The word baab can be produced as follows: S => bS (by PROD 2) => baS (by PROD 1) => baaS (by PROD 1) => baab (by PROD 4) 4 Context Free Language Example 3 Productions 3 and 4 can be used only once and only one of them can be used. , to generate babb we apply in order Prods 2, 1, 2, 4, as below: S => bS => baS => babS => babb 5 Context Free Language Example 4 Let the terminals be a and b, nonterminals be S, X, and Y. The productions are: S → X S → y X → ʎ Y→aY Y → bY Y → a Y → b 6 Context Free Language S → X S → y X

• Tự động hoá
• Theory of automata
• Lecture Theory of automata
• Computer theory
• Theory of computation
• Kleene’s theorem part III
• Concatenation of FAs
• Automata theory
• Automata theory languages
• Automata theory computation
• Pushdown automata
• Context Free grammars
• Regular languages
• Additional classes
• Intractable problems
• Properties of context free languages
• Solution of the task
• Polish notation
• Total language tree
• Null production
• Nullable production
• Theorem regarding CNF
• The START state
• Nondeterministic PDA
• Equivalent PDA
• PDA corresponding to CFG
• STACK alphabet
• Computer science
• CFG corresponding
• Conversion form of PDA
• Recap of PDA
• Non context free language
• Parsing techniques
• Turing machine
• DELETE subprogram
• Kleene’s theorem
• NFA corresponding
• Distinguishable strings
• Indistinguishable strings
• Recap theorem
• Moore machine
• Mealy machine
• Applications of complementing
• Equivalent machines
• Mealy machines
• Complement of a language
• Non regular language
• Example of nonregular language
• Pumping lemma version I