Register

Recent questions tagged ullman

0 votes
0 answers
272
Ullman (TOC) Edition 3 Exercise 3.4 Question 3 (Page No. 122)
We developed the regular expression $(0+1)^{*}1(0+1)+(0+1)^{*}1(0+1)(0+1)$ Use the distributive laws to develop two different,simpler,equivalent expressions.
We developed the regular expression $(0+1)^{*}1(0+1)+(0+1)^{*}1(0+1)(0+1)$ Use the distributive laws to develop two different,simpler,equivalent expressions.
User Avatar
1 votes
0 answers
280
Ullman (TOC) Edition 3 Exercise 3.2 Question 5 (Page No. 108)
Convert the following regular expressions to NFA's with $\in-$transactions. $01^{*}$ $(0+1)01$ $00(0+1)^{*}$ Eliminate $\in-$transactions from your $\in-NFA’s$
Convert the following regular expressions to NFA's with $\in-$transactions. $01^{*}$$(0+1)01$$00(0+1)^{*}$Eliminate $\in-$transactions from your $\in-NFA’s$
User Avatar
0 votes
0 answers
285
Ullman (TOC) Edition 3 Exercise 3.1 Question 4 (Page No. 92)
Give English descriptions of the languages of the following regular expressions$:$ $(1+\in)(00^{*}1)^{*}0^{*}$ $(0^{*}1^{*})^{*}000(0+1)^{*}$ $(0+10)^{*}1^{*}$
Give English descriptions of the languages of the following regular expressions$:$$(1+\in)(00^{*}1)^{*}0^{*}$$(0^{*}1^{*})^{*}000(0+1)^{*}$$(0+10)^{*}1^{*}$
User Avatar
2 votes
0 answers
290
Ullman (TOC) Edition 3 Exercise 2.5 Question 2 (Page No. 79)
Consider the following $\in-NFA.$ Compute the $\in-$closure of each state. Give all the strings of length three or less accepted by the automaton. Convert the automaton to a DFA.
Consider the following $\in-NFA.$ Compute the $\in-$closure of each state. Give all the strings of length three or less accepted by the automaton. Convert the automaton t...
User Avatar
0 votes
0 answers
291
Ullman (TOC) Edition 3 Exercise 2.5 Question 1 (Page No. 79)
Consider the following $\in-NFA.$ Compute the $\in-$closure of each state. Give all the strings of length three or less accepted by the automaton. Convert the automaton to a DFA.
Consider the following $\in-NFA.$Compute the $\in-$closure of each state.Give all the strings of length three or less accepted by the automaton.Convert the automaton to a...
User Avatar
0 votes
0 answers
294
Ullman (TOC) Edition 3 Exercise 2.3 Question 7 (Page No. 68)
In example $2.13$ we claimed that the $NFA$ $N$ is in state $q_{i},$ for $i=1,2,...n,$ after reading input sequence $w$ if and only if the $i^{th}$ symbol from the end of $w$ is $1.$Prove this claim.
In example $2.13$ we claimed that the $NFA$ $N$ is in state $q_{i},$ for $i=1,2,...n,$ after reading input sequence$w$ if and only if the $i^{th}$ symbol from the end ...
User Avatar
0 votes
0 answers
296
Ullman (TOC) Edition 3 Exercise 2.3 Question 5 (Page No. 67)
In the only-if portion of Theorem $2.12$ we omitted the proof by induction on $|w|$ that if $\delta_{D}(q_{0},w)=p$ then $\delta_{N}(q_{0},w)=\{p\}.$ Supply this proof.
In the only-if portion of Theorem $2.12$ we omitted the proof by induction on $|w|$ that if $\delta_{D}(q_{0},w)=p$ then $\delta_{N}(q_{0},w)=\{p\}.$ Supply this proof.
User Avatar
0 votes
1 answer
298
Ullman (TOC) Edition 3 Exercise 2.3 Question 3 (Page No. 66)
Convert the following NFA to a DFA and informally describe the language it accepts.
Convert the following NFA to a DFA and informally describe the language it accepts.
User Avatar
Page: