1 / 5

Finite Automata

Finite Automata. Finite Automata. Finite automata are recognizers A recoganizer for a language L is a program that takes as input a string x and answers “yes” if x is a sentence of L and “no ” otherwise. Finite automata can be : Nondeterministic finite automata (NFA)

donnelly-davis
Download Presentation

Finite Automata

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Finite Automata

  2. Finite Automata • Finite automata are recognizers • A recoganizer for a language L is a program that takes as input a string x and answers “yes” if x is a sentence of L and “no ” otherwise. • Finite automata can be : • Nondeterministic finite automata (NFA) • no restrictions on the labels of their edges. • A symbol can label several edges out of the same state, and , the empty string, is a possible label. • Deterministic finite automata (DFA) • for each state, and for each symbol of its input alphabet exactly one edge with that symbol leaving that state.

  3. Nondeterministic Finite Automata • A nondeterministic finite automaton (NFA) consists of: • A finite set of states S. • A set of input symbols Σ (the input alphabet). empty string, is never a member of Σ. • A transition function that maps state-symbol pairs to sets of states. • A state S0 that is distinguished as the start state (or initial state). • A set of states F, that is distinguished as the accepting states (or final states).

  4. a a b b start 3 2 0 1 b • An NFA can be represented diagrammatically by a labelled directed graph transition graph (transition diagram). • nodes represents states and the labelled edges represent the transition function • Eg for NFA- which recognizes the language (a/b)*abb • The language defined (or accepted) by an NFA is the set of strings labeling some path from the start to an accepting state.

  5. The transitions of an NFA can be represented in tabular form called transition table • Transition table for NFA of regular expression (a/b)*abb • In transition table ,there is a row for each state, and a column for each input symbol and є • The entry for row i and symbol a is the set of possible next states that can be reached from state i on input a.

More Related