Results 1 to 3 of 3

Math Help - Finite Automata Question

  1. #1
    Newbie
    Joined
    Apr 2008
    Posts
    1

    Finite Automata Question

    How can I draw FA over {0, 1} which represent binaries of Integers only divisible by 3 and all leading 0ís are permissible?

    Thanks in advance

    Follow Math Help Forum on Facebook and Google+

  2. #2
    Newbie
    Joined
    Apr 2008
    Posts
    4
    What is FA?
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Lord of certain Rings
    Isomorphism's Avatar
    Joined
    Dec 2007
    From
    IISc, Bangalore
    Posts
    1,465
    Thanks
    6
    Quote Originally Posted by farakhkhan@yahoo.com View Post
    How can I draw FA over {0, 1} which represent binaries of Integers only divisible by 3 and all leading 0’s are permissible?

    Thanks in advance

    Hint:Let the binary number 'x' have k ones in it. Then x = \sum_{j=1}^{ j=k} 2^{i_j}.
    But modulo 3 this reads:
    x \, mod 3 = \sum_{j=1}^{ j=k} (-1)^{i_j}.
    However we want this to be 0 mod 3. Then can you figure out the constraint on i_js?

    Quote Originally Posted by Alvyda
    What is FA?
    Finite Automaton. Its a representation for an state based algorithm. Electronic engineers would simply call it a state machine though
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 1
    Last Post: September 26th 2011, 12:53 PM
  2. Finite Automata limitations
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: December 6th 2010, 10:57 AM
  3. Automata
    Posted in the Discrete Math Forum
    Replies: 10
    Last Post: July 6th 2010, 08:20 AM
  4. Finite Automata question
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: July 7th 2009, 03:33 PM
  5. Questions relating to Sigma & Finite Automata
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: February 3rd 2008, 11:21 AM

Search Tags


/mathhelpforum @mathhelpforum