Scribd Logo
Upload

Welcome to Scribd!

  • Kuis TBO 1810520057 RahayunAmrullahHusaini

    Uploaded by

    Dpm universitas bumigora
    12 views3 pages
    The document is a quiz containing 3 questions about formal language theory: 1. The first question asks to evaluate the values of two formal language expressions. The response provides step-by-step workings to arrive at the possible values for each expression. 2. The second questions asks to describe the string "aabcbbacb" using a given regular grammar. The response uses the grammar rules to rewrite the string. 3. The third question provides a finite automaton diagram and asks to determine the process and output for the input string "bbbaaaba". The response lists the step-by-step process of the automaton for this input string.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document is a quiz containing 3 questions about formal language theory: 1. The first question asks to evaluate the values of two formal language expressions. The response provides step-by-step workings to arrive at the possible values for each expression. 2. The second questions asks to describe the string "aabcbbacb" using a given regular grammar. The response uses the grammar rules to rewrite the string. 3. The third question provides a finite automaton diagram and asks to determine the process and output for the input string "bbbaaaba". The response lists the step-by-step process of the automaton for this input string.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    12 views3 pages

    Kuis TBO 1810520057 RahayunAmrullahHusaini

    Uploaded by

    Dpm universitas bumigora
    The document is a quiz containing 3 questions about formal language theory: 1. The first question asks to evaluate the values of two formal language expressions. The response provides step-by-step workings to arrive at the possible values for each expression. 2. The second questions asks to describe the string "aabcbbacb" using a given regular grammar. The response uses the grammar rules to rewrite the string. 3. The third question provides a finite automaton diagram and asks to determine the process and output for the input string "bbbaaaba". The response lists the step-by-step process of the automaton for this input string.

    Copyright:

    © All Rights Reserved
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    of 3

    Soal Kuis

    Nama : Rahayun Amrullah Husaini


    Nim : 1810520057
    Matakuliah : Teori bahasa dan Otomata
    Dosen Pembina : Ahmatadil
    TahunAkademik : 2021/2022

    Soal :

    1. Tentukan nilai dari operasi Bahasa formal berikut :


    a. 2 + 3 x ((4 x 5) x 1 + 6)* + 7 x 8*
    b. ((a x b) x (a + c)*) + b x c*
    Jawab :
    1. a. 2 + 3 x ((4 x 5) x 1 + 6)* + 7 x 8*
    (4 x 5) = 45
    45 x 1 = 451
    (451 + 6)* =
    (451 + 6)0 = λ
    (451 + 6)1 = 451,6
    (451 + 6)2 = (451 + 6) (451 + 6) = 451451, 4516, 6451, 66
    (451 + 6)3 = (451 + 6) (451 + 6) (451 + 6) = 451451451, 4514516, 4516451, 45166,
    6451451, 64516, 66451, 666, …
    (451 + 6)* = λ , 451, 6, 451451, 4516, 66, 451451451, 4514516, 4516451, 45166,
    6451451, 64516, 666, …
    8* = λ, 8, 88, 888, …
    7 x 8* = λ, 7, 8, 7788, …
    3 x ((4 x 5) x 1 + 6)* = 3, 3451, 36, 3451451, 34516, 366, 3451451451, 34514516,
    34516451, 345166, 36451451, 364516, 3666, …
    2 + 3 x ((4 x 5) x 1 + 6)* = 2, 3, 3451, 36, 3451451, 34516, 366, 3451451451,
    34514516, 34516451, 345166, 36451451, 364516, 3666, …
    2 + 3 x ((4 x 5) x 1 + 6)* + 7 x 8* = 2, 3, 3451, 367, 3451451, 345168, 3667788,
    3451451451,34514516, 34516451, 345166,
    36451451, 364516, 3666, …

    b. ((a x b) x (a + c)*) + b x c*

    (a x b) = ab
    (a + c)* =
    (a + c)0 = λ
    (a + c)1 = a,b
    (a + c)2 = (a + c) (a + c) = aa, ac, ca, cc
    (a + c)3 = (a + c) (a + c) (a + c) = aaa, aac, aca, acc, caa, cac, cca, ccc
    (a + c)* = λ, a, c, aa, ac, ca, cc, aaa, aac, acc, caa, cac, cca, ccc, …
    ((a x b) x (a + c)*) = ab, aba, abc, abaa, abac, abca, abcc, abaaa, abaac, abacc, abcaa,
    abcac, abcca, abccc, …
    c* = λ, c, cc, ccc, …
    b x c* = b , bc, bcc, bccc, …
    ((a x b) x (a + c)) + b x c = b, ab, bc, aba, abc, bcc, abaa, abac, abca, abcc, bccc,
    abaaa, abaac, abacc, abcaa, abcac, abcca, abccc, …

    2. Tata BahasaRegular (RG)


    S aS | bA
    A cS | aA | bB
    B aC | bC | cB
    C cC | a| b
    Pertanyaan :
    Uraikan string : aabcbbacb dengan tatabahasa diatas
    Jawab :
    String : aabcbbacb
    aabcbbacb = S → aS → aaS → aabA → aabcS → aabcbB → aabcbbB →
    aabcbbaC → aabcbbacC → aabcbbacb
    3. Finite Automata

    a
    a

    S F

    Pertanyaan :

    Tentukan proses dan output jika diinputkan string : bbbaaaba

    Jawab :
    Proses :

    You might also like