Register

michael sipser Chapter 1, 3rd edition, question8 a , regular languages

623 views
1 votes
1 votes

give the state diagram of NFAs recognizing the union of the following languages

a.) {w |w begins with a 1 and ends with a 0 }

b.} {w | w contains at least three 1s }

This is how i have solved it. is this correct ?

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

0 votes
0 votes
3 answers
1
anumita asked Jun 6, 2017
3,688 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
2
anumita asked Jun 6, 2017
815 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
3 votes
3 votes
6 answers
3
jaiganeshcse94 asked Jul 27, 2016
5,017 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
Link Copied!