NFA with Null String - Theory of Automata - Lecture Slides, Slides for Theory of Automata. B R Ambedkar National Institute of Technology

Theory of Automata

Description: NFA with Null String, Determine the regular expression, Converting NFA to FA, Language of strings, Applying an NFA on an example of maze, Combination of states are the key points and terms you can learn in this lecture. Other related concepts are also explained in this course.
Showing pages  1  -  4  of  26
1
Recap Lecture 15
Examples of Kleene’s theorem part III
(method 3), NFA, examples, avoiding loop
using NFA, example, converting FA to
NFA, examples, applying an NFA on an
example of maze
Docsity.com
2
Task
Build an FA corresponding to the closure
of the following FA
a
y1± y2
a
b
b
Docsity.com
3
Task solution
Old States New States after reading
a b
Final z1±y1 y2z3 y1z2
z2+y1 y2z3 y1z2
z3y2 y1z2 y2 z3
a
y1± y2
a
b
b
Docsity.com
4
Solution of the Task
a
z1 ± z3
a
b
z2+
b
b
a
Docsity.com
The preview of this document ends here! Please or to read the full document or to download it.
Document information
Uploaded by: parasad
Views: 1315
Downloads : 0
Address:
University: B R Ambedkar National Institute of Technology
Upload date: 06/11/2012
Embed this document:
Docsity is not optimized for the browser you're using. In order to have a better experience please switch to Google Chrome, Firefox, Internet Explorer 9+ or Safari! Download Google Chrome