# Michael Sipser Edition 3 Exercise 1 Question 22 (Page No. 87)

298 views
In certain programming languages, comments appear between delimiters such as $\text{/#}$ and $\text{#/}.$ Let $C$ be the language of all valid delimited comment strings. A member of $C$ must begin with $\text{/#}$ and end with $\text{#/}$ but have no intervening $\text{#/}.$  For simplicity, assume that the alphabet for $C$ is $\text{Σ = \{a, b, /, # \}.}$
a. Give a $DFA$ that recognizes $C.$
b. Give a regular expression that generates $C.$

Regular expression: /#(a + b + /+ #*a + #*b)*#/

## Related questions

1
547 views
Use the procedure described in $\text{Lemma 1.60}$ to convert the following finite automata to regular expressions.
Using the solution you gave to question $25,$ give a formal description of the machines $T_{1}$ and $T_{2}$ depicted in question $24.$
A $\text{finite state transducer (FST)}$ is a type of deterministic finite automaton whose output is a string and not just accept or reject. The following are state diagrams of finite state transducers $T1$ and $T2.$ Each transition of an $FST$ is labeled with two symbols, one designating the input ... 2}$on input bbab}$ g. $\text{$T_{2}$on input bbbbbb}$ h. $\text{$T_{2}$on input$\epsilon$}$