Scribd Logo
Upload

Welcome to Scribd!

  • 178 views

    Finite Automata

    Uploaded by

    Nivedita Valluru
    Finite automata are mathematical models of computation that can represent sequential switching circuits and software behaviors. They are represented as graphs with states as nodes and labeled transitions between states. An example automaton recognizes strings ending in "ing". Automata can be translated to code by implementing each state as a code block that reads input and transitions to the next state. A more complex example models species mating on a distant planet, where the population remains constant but could fail if all individuals are the same species. This example explores how the possible behaviors change as the population size increases.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    Finite Automata

    Uploaded by

    Nivedita Valluru
    178 views22 pages
    Finite automata are mathematical models of computation that can represent sequential switching circuits and software behaviors. They are represented as graphs with states as nodes and labeled transitions between states. An example automaton recognizes strings ending in "ing". Automata can be translated to code by implementing each state as a code block that reads input and transitions to the next state. A more complex example models species mating on a distant planet, where the population remains constant but could fail if all individuals are the same species. This example explores how the possible behaviors change as the population size increases.

    Original Title

    finite automata

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Finite automata are mathematical models of computation that can represent sequential switching circuits and software behaviors. They are represented as graphs with states as nodes and labeled transitions between states. An example automaton recognizes strings ending in "ing". Automata can be translated to code by implementing each state as a code block that reads input and transitions to the next state. A more complex example models species mating on a distant planet, where the population remains constant but could fail if all individuals are the same species. This example explores how the possible behaviors change as the population size increases.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    178 views22 pages

    Finite Automata

    Uploaded by

    Nivedita Valluru
    Finite automata are mathematical models of computation that can represent sequential switching circuits and software behaviors. They are represented as graphs with states as nodes and labeled transitions between states. An example automaton recognizes strings ending in "ing". Automata can be translated to code by implementing each state as a code block that reads input and transitions to the next state. A more complex example models species mating on a distant planet, where the population remains constant but could fail if all individuals are the same species. This example explores how the possible behaviors change as the population size increases.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 22

    Finite Automata

    Motivation An Example

    Informal Explanation
    Finite automata are finite collections of states with transition rules that take you from one state to another. Original application was sequential switching circuits, where the state was the settings of internal bits. Today, several kinds of software can be modeled by FA.
    2

    Representing FA
    Simplest representation is often a graph.
    Nodes = states. Arcs indicate state transitions. Labels on arcs tell what causes the transition.

    Example: Recognizing Strings Ending in ing


    Not i or g Not i Not i or n

    i n
    Saw in

    nothing Start

    Saw i

    Saw ing

    Automata to Code
    In C/C++, make a piece of code for each state. This code:
    1. Reads the next input. 2. Decides on the next state. 3. Jumps to the beginning of the code for that state.

    Example: Automata to Code


    2: /* i seen */ c = getNextInput(); if (c == n) goto 3; else if (c == i) goto 2; else goto 1; 3: /* in seen */ . . .
    6

    Automata to Code Thoughts


    How would you do this in Java, which has no goto? You dont really write code like this. Rather, a code generator takes a regular expression describing the pattern(s) you are looking for.
    Example: .*ing works in grep.
    7

    Example: Protocol for Sending Data


    data in Ready Sending Start ack timeout

    Extended Example
    Thanks to Jay Misra for this example. On a distant planet, there are three species, a, b, and c. Any two different species can mate. If they do:
    1. The participants die. 2. Two children of the third species are born.
    9

    Strange Planet (2)


    Observation: the number of individuals never changes. The planet fails if at some point all individuals are of the same species.
    Then, no more breeding can take place.

    State = sequence of three integers the numbers of individuals of species a, b, and c.


    10

    Strange Planet Questions


    In a given state, must the planet eventually fail? In a given state, is it possible for the planet to fail, if the wrong breeding choices are made?

    11

    Questions (2)
    These questions mirror real ones about protocols.
    Can the planet fail? is like asking whether a protocol can enter some undesired or error state. Must the planet fail is like asking whether a protocol is guaranteed to terminate.
    Here, failure is really the good condition of termination.
    12

    Strange Planet Transitions


    An a-event occurs when individuals of species b and c breed and are replaced by two as. Analogously: b-events and c-events. Represent these by symbols a, b, and c, respectively.

    13

    Strange Planet with 2 Individuals


    200 a 011 020 b 101 002 c 110

    Notice: all states are must-fail states.


    14

    Strange Planet with 3 Individuals


    a 300 a 210 c 102 b 021 201 b 111 b 030 c 003 a 120 c 012

    Notice: four states are must-fail states. The others are cant-fail states. State 111 has several transitions.
    15

    Strange Planet with 4 Individuals


    211 a c 103 b 022 c a b 130 b 400 121 a 310 c 202 a c 013 b 040 c 112 b 031 a 220 b c a 301 004

    Notice: states 400, etc. are must-fail states. All other states are might-fail states.
    16

    Taking Advantage of Symmetry


    The ability to fail depends only on the set of numbers of the three species, not on which species has which number. Lets represent states by the list of counts, sorted by largest-first. Only one transition symbol, x.

    17

    The Cases 2, 3, 4
    110 x 200 111 x 300 x 211 x 310 x 210 x Notice: for the case n = 4, there is nondeterminism : different transitions are possible from 211 on the same input. 18 220 x 400

    5 Individuals
    500 410 221

    320

    311

    Notice: 500 is a must-fail state; all others are might-fail states.


    19

    6 Individuals
    600 510 420 411 330 222

    321

    Notice: 600 is a must-fail state; 510, 420, and 321 are cant-fail states; 411, 330, and 222 are might-fail states.

    20

    7 Individuals
    700 610 322 331

    520 511 430

    421

    Notice: 700 is a must-fail state; All others are might-fail states.


    21

    Questions for Thought


    1. Without symmetry, how many states are there with n individuals? 2. What if we use symmetry? 3. For n individuals, how do you tell whether a state is must-fail, mightfail, or cant-fail?

    22

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy