Results 1 to 2 of 2

Math Help - please help with this Q...... of Finite automaton

  1. #1
    Newbie
    Joined
    Nov 2009
    From
    Canada, NWT
    Posts
    20

    please help with this Q...... of Finite automaton

    let L be a regular language of binary strings.

    let L* be another language such that (x:x belong to L and x ^ R belong to L) where x ^ R is the reverse

    show that L* is also regular
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Super Member
    Joined
    Aug 2009
    From
    Israel
    Posts
    976
    The idea here is to make a new automaton which computes x and x^R simultaneously, such that it will enter an accepting state iff both x and x^R enter an accept state at the same point of the computation. You complete the details.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Distinct Bases for Finite Vector Spaces over Finite Fields
    Posted in the Advanced Algebra Forum
    Replies: 5
    Last Post: May 29th 2011, 01:31 PM
  2. Replies: 1
    Last Post: May 21st 2011, 05:17 AM
  3. finite Automaton
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: October 11th 2010, 10:25 PM
  4. Discrete Finite Automaton and the pumping lemma
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: September 24th 2009, 05:39 AM
  5. finite automaton proof
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: September 20th 2008, 03:35 PM

Search Tags


/mathhelpforum @mathhelpforum