Question

Z → aX | bY 5. Convert the following CFG into CNF. (10 points) S → aXXbY X → abX | a Y → bby | b Part III: (30 points) 1. Convert the following FA into a PDA. (10 points) 2. Build the PDA accepting the same language as this CFG (10 points) S → XaXb X → aX | bX | λ 3. Draw the trace of PDA (State, Stack and input Tape) in a table format when the following PDA processes the following input string aabcbaa. Note that the input alphabet is {a, b, c}. (10 points)

Name: z ax by 5 convert the following cfg into cnf 10 points s axxby x abx a y bby b part iii 30 points 1 convert the following fa into a pda 10 points 2 build the pda accepting the same language 19757
Uploaded: 2023-07-11T13:00:00-08:00
Duration: 1 min 3 s
Channel: Madhur L
Description: z ax by 5 convert the following cfg into cnf 10 points s axxby x abx a y bby b part iii 30 points 1 convert the following fa into a pda 10 points 2 build the pda accepting the same language 19757

          Z → aX | bY
5. Convert the following CFG into CNF. (10 points)
S → aXXbY
X → abX | a
Y → bby | b
Part III: (30 points)
1. Convert the following FA into a PDA. (10 points)
2. Build the PDA accepting the same language as this CFG (10 points)
S → XaXb
X → aX | bX | λ
3. Draw the trace of PDA (State, Stack and input Tape) in a table format
when the following PDA processes the following input string aabcbaa.
Note that the input alphabet is {a, b, c}. (10 points)

z ax by 5 convert the following cfg into cnf 10 points s axxby x abx a y bby b part iii 30 points 1 convert the following fa into a pda 10 points 2 build the pda accepting the same language 19757

Added by Sarah S.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Madhur L

07/11/2023

Step 1

The given CFG is: S → aXXbY X → abX | a Y → bby | b Show more…

Show all steps

Thanks for your feedback!

Z → aX | bY 5. Convert the following CFG into CNF. (10 points) S → aXXbY X → abX | a Y → bby | b Part III: (30 points) 1. Convert the following FA into a PDA. (10 points) 2. Build the PDA accepting the same language as this CFG (10 points) S → XaXb X → aX | bX | λ 3. Draw the trace of PDA (State, Stack and input Tape) in a table format when the following PDA processes the following input string aabcbaa. Note that the input alphabet is {a, b, c}. (10 points)