Finite Automata exercise

Discussion in 'Homework Help' started by andrea123, May 18, 2016.

  1. andrea123

    Thread Starter New Member

    May 18, 2016
    Hello everyone,
    Can someone please help me resolve this exercise?
    It is considered an automata that recognizes the binary sequence: 01010^n where n> 0.
    1. Draw the graph describing the machine.
    2. Draw the structure of the automata.
    3. Describe the automata in Verilog.
  2. WBahn


    Mar 31, 2012
    This is Homework Help, not Homework Done For You.

    You need to show YOUR best attempt to solve YOUR homework -- that gives us a starting point from which to help guide you to a solution.

    Having said that, your spec is a bit ambiguous. Does the repetition only apply to the trailing 0 in the string, or to the entire string. As written, it only applies to the trailing zero.