Register

Exercise 1.30 from the textbook "Introduction to the Theory of Computation" by Michael Sipser (3rd edition).

220 views
0 votes
0 votes

For the following regular expression:
a+|(ab)+
Over the alphabet:
{a,b}
Give an epsilon-NFA that recognizes the same language.

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

3 votes
3 votes
6 answers
1
jaiganeshcse94 asked Jul 27, 2016
4,956 views
Introduction to theory of computing by "Michael sipser" 3rd edition page no:37
A minimal DFA diagram for the language A = {w| w contains at least one 1 and an even number of 0s follow the last 1}?
A minimal DFA diagram for the language A = {w| w contains at least one 1 and an even number of 0s follow the last 1}?
User Avatar
0 votes
0 votes
0 answers
2
vishnu777 asked Sep 28, 2021
1,768 views
Can anyone keep the solution manual of Horowitz and sahani introduction to algo textbook
Can anyone please keep the solution manual of Horowitz and sahani introduction to algorithms textbook
Can anyone please keep the solution manual of Horowitz and sahani introduction to algorithms textbook
User Avatar
0 votes
0 votes
3 answers
3
anumita asked Jun 6, 2017
3,602 views
michael sipser chp 1, 3rd edition, Q 12 , dfa
let D= {w | w contains an even no. of a's and an odd no. of b's and does not contain the substring ab } give a DFA with Five states that recognizes D and a regular expression that generates D.
let D= {w | w contains an even no. of a's and an odd no. of b's and does not contain the substring ab }give a DFA with Five states that recognizes D and a regular express...
User Avatar
1 votes
1 votes
1 answer
4
anumita asked Jun 6, 2017
812 views
michael sipser chpater 1 3rd edition Q. 9 nfa
Give state diagrams of NFAs recognizing the concatenation of the languages a.) {w | the length of w is at most 5 } b.) {w | every odd position of w is 1 } The NFA has to be made by concatenating two different NFAs. how can this be done ?
Give state diagrams of NFAs recognizing the concatenation of the languagesa.) {w | the length of w is at most 5 }b.) {w | every odd position of w is 1 }The NFA has to be ...
User Avatar
Link Copied!