Results 1 to 4 of 4

Math Help - Prueba

  1. #1
    Newbie
    Joined
    Mar 2010
    From
    Uruguay
    Posts
    12

    Prueba

    How can I demostrate that language \Gamma have words of any large exept two?

    (i) \epsilon\in\Gamma
    (ii)a\in\Gamma
    (iii)\mbox{ If } \alpha\in\Gamma\mbox{ and }\beta\in\Gamma, \Rightarrow b\alpha c\beta b \in\Gamma

    Thank you!
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Newbie
    Joined
    Mar 2010
    From
    Uruguay
    Posts
    12
    I got a mistake in the title but don't know how to change it
    Follow Math Help Forum on Facebook and Google+

  3. #3
    MHF Contributor
    Joined
    Oct 2009
    Posts
    5,527
    Thanks
    773
    How can I demostrate that language have words of any large exept two?
    Of any length? The set L of lengths of words in \Gamma has the following properties: 0\in L; 1\in L; m,n\in L\Rightarrow m+n+3\in L.

    Show that 3,4,5\in L. Then 0+3+3=6, 0+4+3=7 and 0+5+3=8 are also in L. This can be continued.
    Follow Math Help Forum on Facebook and Google+

  4. #4
    Newbie
    Joined
    Mar 2010
    From
    Uruguay
    Posts
    12
    Thanks emakarov!

    Yes of any length, I can proof by induction method on the basis of the induction definition you gave...
    Follow Math Help Forum on Facebook and Google+

Search Tags


/mathhelpforum @mathhelpforum