• edited by
14,700 views
52 52 votes

Given below are the transition diagrams for two finite state machines $M_1$ and $M_2$ recognizing languages $L_1$ and $L_2$ respectively.

  1. Display the transition diagram for a machine that recognizes $L_1.L_2$, obtained from transition diagrams for $M_1$ and $M_2$ by adding only $\varepsilon$ transitions and no new states.

  2. Modify the transition diagram obtained in part (a) obtain a transition diagram for a machine that recognizes $(L_1.L_2)^*$ by adding only $\varepsilon$ transitions and no new states.

    (Final states are enclosed in double circles).

2 Answers

Best answer
54 54 votes

We can combine the final state of $M_1$ with the start state of $M_2$ as follows recognizing $L_1L_2$. But before we combine $M_1$ and $M_2$ remove the final state of $M_1$ as the new machine can accept $L_1$ also while it should accept only $L_1.L2$.

~Pic by Praveeen Saini

• edited by
17 17 votes

Hi

• edited by
Position:
Show:

Related questions

27 27 votes
2 answers 2 answers
9.6k
9.6k views
Kathleen asked Oct 9, 2014
9,563 views
Let $Q=\left( \left\{q_1,q_2 \right\}, \left\{a,b\right \}, \left\{a,b,\bot \right\}, \delta, \bot, \phi \right)$ be a pushdown automaton accepting by empty stack for the...
12 12 votes
1 answers 1 answer
4.2k
4.2k views
go_editor asked Feb 10, 2018
4,216 views
Consider the synchronous sequential circuit in the below figureGiven that the initial state of the circuit is $S_4,$ identify the set of states, which are not reachable.
25 25 votes
4 answers 4 answers
10.0k
10.0k views
Kathleen asked Oct 9, 2014
10,020 views
Consider the synchronous sequential circuit in the below figureDraw a state diagram, which is implemented by the circuit. Use the following names for the states correspon...
47 47 votes
3 answers 3 answers
15.4k
15.4k views
Kathleen asked Oct 9, 2014
15,435 views
A file system with a one-level directory structure is implemented on a disk with disk block size of $4K$ bytes. The disk is used as follows:$$\begin{array}{|l|}\hline \te...