MyCH02 FA.pptx - Chapter 2 Finite Automata At the end of the module the student must be able to Learning Outcomes \u2022 describe language accepted by a

MyCH02 FA.pptx - Chapter 2 Finite Automata At the end of...

This preview shows page 1 - 9 out of 35 pages.

Chapter 2 Finite Automata
Image of page 1
Learning Outcomes At the end of the module, the student must be able to: describe language accepted by a given automata. construct finite automata for a given regular language.
Image of page 2
Topics Deterministic Finite Accepters (DFA) Nondeterministic Finite Accepters (NFA)
Image of page 3
DFA (2.1) Deterministic Finite Acceptors Example DFA Formal Definition of a DFA Languages and Regular Languages Several examples
Image of page 4
DFA (2.1) Deterministic Finite Acceptors DFAs are: Deterministic--there is no element of choice Finite--only a finite number of states and arcs Acceptors--produce only a yes/no answer A DFA is drawn as a graph, with each state represented by a circle. start state One designated state is the start state. final state Some states (possibly including the start state) can be designated as final states. transition Arcs between states represent state transitions -- each such arc is labeled with the symbol that triggers the transition.
Image of page 5
DFA (2.1) Formal Definition of a DFA A deterministic finite acceptor or dfa is a quintuple: M = (Q, , , q 0 , F) where Q is a finite set of internal states , is a finite set of symbols, the input alphabet , : Q Q is a transition function , q 0 Q is the initial state , F Q is a set of final states . Note: The fact that is a function implies that every vertex has an outgoing arc for each member of .
Image of page 6
The graph in Fig. represent the dfa M = ({q 0 ,q 1 ,q 2 }, {0,1}, , q 0 , {q 1 }) where is given by (q 0 ,0)= q 0 (q 0 ,1)= q 1 (q 1 ,0)= q 0 (q 1 ,1)= q 2 (q 2 ,0)= q 2 (q 2 ,1)= q 1 DFA (2.1) Example DFA
Image of page 7
Question Based on the given DFA, trace the following input string: 1 0 1, 0111, 100, 1100 Analysis Start with the
Image of page 8
Image of page 9

You've reached the end of your free preview.

Want to read all 35 pages?

  • Fall '16
  • Jennifer Smith
  • Formal language, Regular expression, Regular language, Nondeterministic finite state machine, Automata theory

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern

Stuck? We have tutors online 24/7 who can help you get unstuck.
A+ icon
Ask Expert Tutors You can ask You can ask You can ask (will expire )
Answers in as fast as 15 minutes