Theory of Automata
& Formal Languages
Finite Automata (DFA, NFA, ε-NFA)
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Guidelines and tips
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
FINITE AUTOMATA SLIDES, Slides of Theory of Automata
finite automata is an introductory topic of theory of automata or compilers so here are some detailed slides
Typology: Slides
2021/2022
1 / 9
This page cannot be seen from the preview
Don't miss anything!
Related documents
Partial preview of the text
Download FINITE AUTOMATA SLIDES and more Slides Theory of Automata in PDF only on Docsity!
Theory of Automata
& Formal Languages
Finite Automata (DFA, NFA, ε-NFA)
Course Contents Regular Languages Regular Expressions Representor LLG RLG Generator Grammars Acceptor Finite Automata Push Down Automata Turing Machines Without output (^) With output DFA NFA^ ε- NFA^ Moore Machine Mealy Machine
Finite Automata
- Finite Automata(FA) is the simplest machine to recognize patterns.
- The finite automata or finite state machine is an abstract machine which have
five elements or tuple.
- (^) It has a set of states and rules for moving from one state to another but it
depends upon the applied input symbol.
- (^) Basically it is an abstract model of digital computer. Following figure shows some
essential features of a general automation.
Types of Finite Automata (FA) Finite Automata exist in following three types:
- Deterministic Finite Automata (DFA)
- Non-Deterministic Finite Automata (NFA)
- Non-Deterministic Finite Automata with ε transitions (ε-NFA)
Non Deterministic Finite Automata with ε moves (ε -NFA) c
Non Deterministic Finite Automata (NFA) It is similar to ε-NFA, Except it don’t have ε-transitions. Furthermore every NFA is also a ε-NFA