Dark Mode

Recent questions tagged state-diagram

0 votes

1 answer

1

Michael Sipser Edition 3 Exercise 1 Question 10 (Page No. 85)
Use the construction in the proof of $\text{Theorem 1.49}$ to give the state diagrams of $NFA's$ recognizing the star of the languages described in $\text{\{w| w contains at least three 1s\}}$ $\text{\{w| w contains at least two 0's and at most one 1\}}$ $\text{The empty set}$

admin asked in Theory of Computation Apr 21, 2019

by admin

1.9k views

0 votes

0 answers

2

Michael Sipser Edition 3 Exercise 1 Question 9 (Page No. 85)
Use the construction in the proof of $\text{Theorem 1.47}$ to give the state diagrams of $\text{NFA's}$ recognizing the concatenation of the languages described in and input alphabet is $\Sigma=\{0,1\}$ L1={w| the length of w is at ... L2={w| every odd position of w is a 1} L1={w| w contains at least three 1s} and L2=The empty set

admin asked in Theory of Computation Apr 21, 2019

by admin

2.1k views

0 votes

1 answer

3

Michael Sipser Edition 3 Exercise 1 Question 8 (Page No. 84)
Use the construction in the proof of $\text{Theorem 1.45}$ to give the state diagrams of $\text{NFA's}$ ...

admin asked in Theory of Computation Apr 21, 2019

by admin

4.5k views

1 vote

1 answer

4

Michael Sipser Edition 3 Exercise 1 Question 7 (Page No. 84)
Give state diagrams of $\text{NFA's}$ with the specified number of states recognizing each of the following languages. In all parts, the alphabet is $\{0,1\}.$ $\text{The language \{w| w ends with 00\} with three states}$ ... $\text{The language}$ $\{\epsilon\}$ $\text{with one state}$ $\text{The language 0* with one state}$

admin asked in Theory of Computation Apr 21, 2019

by admin

14.9k views

4 votes

1 answer

5

Michael Sipser Edition 3 Exercise 1 Question 6 (Page No. 84)
Give state diagrams of DFAs recognizing the following languages. In all parts, the alphabet is $\{0,1\}.$ $\text{\{w| w begins with a 1 and ends with a 0\}}$ $\text{\{w| w contains at least three 1s\}}$ ... $\text{The empty set}$ $\text{All strings except the empty string}$

admin asked in Theory of Computation Apr 21, 2019

by admin

19.0k views

4 votes

0 answers

6

Michael Sipser Edition 3 Exercise 1 Question 4 (Page No. 83)
Each of the following languages is the intersection of two simpler languages. In each part, construct $\text{DFAs}$ for the simpler languages, then combine them using the construction discussed in footnote $\text{3 (page 46)}$ to give the state diagram of ... $\text{\{w| w has even length and an odd number of a's\}}$

admin asked in Theory of Computation Apr 21, 2019

by admin

1.8k views

0 votes

0 answers

7

Michael Sipser Edition 3 Exercise 1 Question 3 (Page No. 83)
The formal description of a $\text{DFA}$ $\text{M}$ is $({q1, q2, q3, q4, q5}, {u, d}, δ, q3, {q3}),$ where $\text{δ}$ is given by the following table. Give the state diagram of this machine.

admin asked in Theory of Computation Apr 21, 2019

by admin

778 views

To see more, click for the full list of questions or popular tags.

Recent questions tagged state-diagram