Question

Start b Read$_1$ Push b Push a Read$_2$ b A A Accept Read$_4$ Pop b Read$_3$ Extra Credit: (20 points) 1. Build a Turing Machine that accepts strings that contain the substring bbb (10 points) 2. Draw the transition graph corresponding to the following regular grammar and find the regular expression of the language it generates. (10 points) $S \to aS | bX$ $X \to aY | bY | a$ $Y \to aY | b$

Name: start b read1 push b push a read2 b a a accept read4 pop b read3 extra credit 20 points 1 build a turing machine that accepts strings that contain the substring bbb 10 points 2 draw the 78263
Uploaded: 2023-08-07T22:20:26-08:00
Duration: 3 min 29 s
Channel: Akash M
Description: start b read1 push b push a read2 b a a accept read4 pop b read3 extra credit 20 points 1 build a turing machine that accepts strings that contain the substring bbb 10 points 2 draw the 78263

          Start
b
Read$_1$
Push b
Push a
Read$_2$
b
A
A
Accept
Read$_4$
Pop
b
Read$_3$
Extra Credit: (20 points)
1. Build a Turing Machine that accepts strings that contain the substring
bbb (10 points)
2. Draw the transition graph corresponding to the following regular
grammar and find the regular expression of the language it generates.
(10 points)
$S \to aS | bX$
$X \to aY | bY | a$
$Y \to aY | b$

start b read1 push b push a read2 b a a accept read4 pop b read3 extra credit 20 points 1 build a turing machine that accepts strings that contain the substring bbb 10 points 2 draw the 78263

Added by Antonia H.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Akash M

08/07/2023

Step 1

The grammar is given by: $S \to aS | bX$ $X \to aY | bY | a$ $Y \to aY | b$ Show more…

Show all steps

Thanks for your feedback!

Start b Read$_1$ Push b Push a Read$_2$ b A A Accept Read$_4$ Pop b Read$_3$ Extra Credit: (20 points) 1. Build a Turing Machine that accepts strings that contain the substring bbb (10 points) 2. Draw the transition graph corresponding to the following regular grammar and find the regular expression of the language it generates. (10 points) $S \to aS | bX$ $X \to aY | bY | a$ $Y \to aY | b$