TAILIEUCHUNG - Lecture note Theory of automata - Lecture 24

Lecture Theory of automata - Lecture 24 includes the following content: Regular languages, complement of a language, theorem, proof, example, intersection of two regular languages. | Lecture # 10 Theory Of Automata By Dr. MM Alam 1 1 Lecture 9 at a glance Kleene Theorem Part I and Part II Kleene Theorem Part III (Union) 2 Repeat – Kleene Part III Every Regular Expression can be represented by an FA We already know that a regular expression has a corresponding FA. However, the difficult part is that a regular expression can be combined with other regular expression through union (sum), concatenation and closure of FA. Thus, we need to devise methods for FA1+FA2, FA1FA2, FA1 Closure. 3 Repeat – Kleene Theorem Part III (Union) If r1+r2 represents a regular expression r3, then FA+FA2 represents an FA3 that correspond to r3. Start by taking both FA’s initial state and traversing on each input symbol in the respective FA Since one initial state is allowed in FA, therefore, only one state can be marked as initial state During the process, any state encountered final, the resultant state will be final. This is due to the fact that multiple final states are allowed in FA.

• Tự động hoá
• Theory of automata
• Lecture Theory of automata
• Computer theory
• Theory of computation
• Regular languages
• Complement of a language
• Automata theory
• Automata theory languages
• Automata theory computation
• Pushdown automata
• Context Free grammars
• 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
• Concatenation of FAs
• Distinguishable strings
• Indistinguishable strings
• Recap theorem
• Moore machine
• Mealy machine
• Applications of complementing
• Equivalent machines
• Mealy machines
• Non regular language
• Example of nonregular language
• Pumping lemma version I