Register

Michael Sipser Edition 3 Exercise 1 Question 1 (Page No. 83)

• edited by
1,489 views
0 votes
0 votes

The following are the state diagrams of two $\text{DFAs,}$ $\text{M1}$, and $\text{M2.}$ Answer the following questions about each of these machines.

  1. What is the start state?
  2. What is the set of accept states?
  3. What sequence of states does the machine go through on input $\text{aabb?}$
  4. Does the machine accept the string $\text{aabb?}$
  5. Does the machine accept the string $\epsilon?$
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
2
admin asked Apr 21, 2019
798 views
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.
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 ...
User Avatar
0 votes
0 votes
0 answers
3
admin asked Apr 21, 2019
838 views
Michael Sipser Edition 3 Exercise 1 Question 2 (Page No. 83)
Give the formal description of the machines $\text{M1}$ and $\text{M2.}$
Give the formal description of the machines $\text{M1}$ and $\text{M2.}$
User Avatar
Link Copied!