Gp23_TheoryOfComputation_Assignment1 by Cho Xin Yue https://padlet.com/xyue1311/1vgjj4mu8c8v9cam en-us 2025-05-09 08:32:47 UTC 2025-06-07 07:18:54 UTC hello@padlet.com L = {w  {a, b}* | w has b’s followed by a’s} xyue1311 https://padlet.com/xyue1311/1vgjj4mu8c8v9cam/wish/3443288417 2025-05-09 08:32:47 UTC https://padlet.com/xyue1311/1vgjj4mu8c8v9cam/wish/3443288417 Construct a Regular Grammar for the set of strings over the alphabets {a, b, c} where every ais followed by at least one b. xyue1311 https://padlet.com/xyue1311/1vgjj4mu8c8v9cam/wish/3443290493 2025-05-09 08:34:47 UTC https://padlet.com/xyue1311/1vgjj4mu8c8v9cam/wish/3443290493 Let G be the grammar.S → aS | aA | aA → aAb | ab(a) Using this grammar, produce two leftmost derivations of the string ”aaaabb”.(b) Build the parse trees for the derivations from part (a). xyue1311 https://padlet.com/xyue1311/1vgjj4mu8c8v9cam/wish/3443296218 2025-05-09 08:39:26 UTC https://padlet.com/xyue1311/1vgjj4mu8c8v9cam/wish/3443296218 Let G be the grammar.S → aSb | aAbA → cAd | BB → aBb | (λ)Use leftmost or rightmost derivation to construct a parse tree, on the following strings:(a) “aacabdbb”(b) “aaaaabbbbb” See if any of the above strings can be derived by more than one parsetree xyue1311 https://padlet.com/xyue1311/1vgjj4mu8c8v9cam/wish/3443296564 2025-05-09 08:39:41 UTC https://padlet.com/xyue1311/1vgjj4mu8c8v9cam/wish/3443296564 3b.)The set of strings over {a, b, c} that begin with a, contain exactly two consecutive b’s and end with cc. e.g., valid strings are: abbcc, accaccaccabbacacaccccc, etc. xyue1311 https://padlet.com/xyue1311/1vgjj4mu8c8v9cam/wish/3467493763 2025-05-26 11:36:58 UTC https://padlet.com/xyue1311/1vgjj4mu8c8v9cam/wish/3467493763 3c) The set of strings over {a, b, c} that do not contain the substring aa. e.g., valid strings are λ, a, b, c, bbbbbbbbb, ccccccc, abc, abba, baba, bacabbababacabcaba, etc. xyue1311 https://padlet.com/xyue1311/1vgjj4mu8c8v9cam/wish/3467494086 2025-05-26 11:37:18 UTC https://padlet.com/xyue1311/1vgjj4mu8c8v9cam/wish/3467494086 1c) The language L = {w  {a, b}* : w has twice as many b’s as a’s} //the “ : “ symbol is synonymous to the symbol “ | “, meaning where. xyue1311 https://padlet.com/xyue1311/1vgjj4mu8c8v9cam/wish/3467500994 2025-05-26 11:45:07 UTC https://padlet.com/xyue1311/1vgjj4mu8c8v9cam/wish/3467500994 Construct a PDA for the language over {a, b}, where if the strings have any b’s then all a’s xyue1311 https://padlet.com/xyue1311/1vgjj4mu8c8v9cam/wish/3467501272 precede all the b’s.

e.g., ab, aaaabb, aabbbb, a, aa, aaaaaaaaaaaaaaa etc.

]]> 2025-05-26 11:45:28 UTC https://padlet.com/xyue1311/1vgjj4mu8c8v9cam/wish/3467501272