Ch-1.28: NFA Example Part 2 | GATE CSE Lecture

In this lecture i discussed how to Construct NFA for following Infinite language.
L4 :{Every string start and end with same symbol}.
L5 :{Every string start and end with different symbol}.
L6 :{The 3rd symbol from left end is a}.
L7 :{The 3rd symbol from right end is b}.
--------------------------------------------------------------------------------------------
Ch-1.12: DFA for Every string start and end with ‘0’,same symbol ,different symbol, Σ={0,1} https://youtu.be/HvE-h4wXtL8
{The 3rd symbol from left end is 1} https://youtu.be/7eouxMd-wuo

Ch-1.16:Design DFA for The 2nd symbol from right end is '0' |The 3rd symbol from right end is '1' https://youtu.be/9N5M1Ak73XU

-----------------------------------------------------------------
Subscribe my channel for more updates https://www.youtube.com/monalisacs
----------------------------------------------------------------------
Theory Of Computation Lecture https://www.youtube.com/watch?v=vDJjYGui3Ho&list=PL767-rEuXhcPQWMuHXOCZzj5PqF9YBVZt
-------------------------------------------------------------------
TOC GATE Previous Questions Solved by Monalisa https://www.youtube.com/watch?v=K5wIww1OnCY&list=PL767-rEuXhcN7sn9TCRxhmvDpG7RLT3UK
-------------------------------------------------------------------
Data Structure Lecture: https://www.youtube.com/watch?v=mYDsGejk3zg&list=PL767-rEuXhcMiMbX4IU_oqWshY6z8Rc7j
---------------------------------------------------------------------
Data Structure Previous 10 year Questions: https://www.youtube.com/watch?v=mYDsGejk3zg&list=PL767-rEuXhcOWUPgW1RrIkUKAle1YBdh1
-----------------------------------------------------------------------

#NFA#GATECSE#Automata