Results 1 to 2 of 2

Math Help - Automata Languages and DFA etc.

  1. #1
    Newbie
    Joined
    Sep 2011
    Posts
    15

    Automata Languages and DFA etc.

    Exhibit the languages L1 and L2 such that

    L*1 ∩ L*2 ≠ ( L1 ∩ L2 )*

    Note: L1 = L base 1 etc

    -My attempt-

    L1 = {a,b}
    L2 = {a,ab}
    L1 ∩ L2 = {a}
    (L1 ∩ L2)* = {a}*
    L1* ∩ L2* =/= {a}*

    Is there any problem with my answer or does it needs more work.

    Thanks
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor
    Joined
    Oct 2009
    Posts
    5,551
    Thanks
    783

    Re: Automata Languages and DFA etc.

    The answer is fine. Perhaps you can say why L1* ∩ L2* =/= {a}*: e.g., ab ∈ L1* ∩ L2*, but ab ∉ {a}*.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. How many different languages?
    Posted in the Discrete Math Forum
    Replies: 8
    Last Post: August 22nd 2011, 05:56 AM
  2. Languages and FSM.
    Posted in the Discrete Math Forum
    Replies: 5
    Last Post: April 5th 2011, 01:09 PM
  3. context free languages
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: November 30th 2010, 06:11 PM
  4. countability of languages
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: November 21st 2010, 11:18 AM
  5. countable languages..please help!
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: November 17th 2010, 06:18 AM

Search Tags


/mathhelpforum @mathhelpforum