Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged epsilon-nfa
0
votes
0
answers
1
Ullman (TOC) Edition 3 Exercise 3.2 Question 7 (Page No. 108)
There are some simplefications to the constructions of Theorem, where we converted a regular expression to an $\in-NFA$ Here are three$:$ For the union operator instead of creating new start and accepting states, merge ... may be made to the construction together , while still yielding a correct automaton for every regular expession$?$
There are some simplefications to the constructions of Theorem, where we converted a regular expressionto an $\in-NFA$ Here are three$:$For the union operator instead of ...
admin
418
views
admin
asked
Apr 3, 2019
Theory of Computation
ullman
theory-of-computation
finite-automata
epsilon-nfa
+
–
0
votes
0
answers
2
Ullman (TOC) Edition 3 Exercise 3.2 Question 6 (Page No. 108)
Let $A=(Q,\sum,\delta,q_{0},\{q_{f}\})$ be an $\in-NFA$ such that there are no transitions into $q_{0}$ and no transactions out of $q_{f}.$Describe the language accepted by each of the following modifications of $A,$in ... state that can reach $q_{f}$ along some path. The automaton constructed from $A$ by doing both $(b)$ and $(c).$
Let $A=(Q,\sum,\delta,q_{0},\{q_{f}\})$ be an $\in-NFA$ such that there are no transitions into $q_{0}$ and no transactions out of $q_{f}.$Describe the language accepted ...
admin
337
views
admin
asked
Apr 3, 2019
Theory of Computation
ullman
theory-of-computation
finite-automata
epsilon-nfa
+
–
2
votes
0
answers
3
Ullman (TOC) Edition 3 Exercise 2.5 Question 3 (Page No. 79 - 80)
Design $\in-$NFA's for the following languages. Try to use $\in-$transitions to simplify your design. The set of strings consisting of zero or more $a's$ followed by zero or more $b's$ ... strings of $0's$ and $1's$ such that at least one of the last ten positions is a $1.$
Design $\in-$NFA's for the following languages. Try to use $\in-$transitions to simplify your design.The set of strings consisting of zero or more $a's$ followed by zero ...
admin
807
views
admin
asked
Apr 3, 2019
Theory of Computation
ullman
theory-of-computation
finite-automata
epsilon-nfa
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register