343 views

2 Answers

0 votes
0 votes
Non deterministic finite automata diagram
NFA diagram

 

0 votes
0 votes

 

FINITE AUTOMATA ........

 

Related questions

0 votes
0 votes
1 answer
2
M_Umair_Khan42900 asked Dec 29, 2022
743 views
Show that the following pairs of regular expressions define the same language over the alphabet I = [a, b].s(a) p(pp)*( A + p)q + q and p*q(b) A +0(0+1)* + (0+1)* 00(0+1)...
0 votes
0 votes
1 answer
3
Abhipsa asked Jan 21, 2019
836 views
Why this is not equal?(r+s)*=r*+s*