791 views

1 Answer

0 votes
0 votes

We can concatenate NFA similar to DFA,

Related questions

0 votes
0 votes
3 answers
1
anumita asked Jun 6, 2017
3,549 views
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...
1 votes
1 votes
0 answers
2
anumita asked Jun 6, 2017
594 views
give the state diagram of NFAs recognizing the union of the following languagesa.) {w |w begins with a 1 and ends with a 0 }b.} {w | w contains at least three 1s }This is...
3 votes
3 votes
6 answers
3
jaiganeshcse94 asked Jul 27, 2016
4,886 views
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}?