Hello VU students here is the solution of CS402-Thoery of Automata GDB No.1 Spring 2019. GDB total marks 5.Due
date Aug 8, 2019. GDB Solution file. You also like our Facebook Page, Join Facebook Group, follow on Google+ and Subscribe our YouTube Channel. Please Share it with your Friends.
Thank you.
Solution for the
GDB is presented for your convenience. Download it and make it according to
your requirement and do not copy paste.
GDB Solution:
a) Yes:
As we know that
FA`s deterministic and PDA`s are deterministic and non-deterministic as well.
So it is very clear that languages which are accepted by FA`s will also be
accepted by PDA`s. you can give examples of any regular language like language
starting with and ending with different letters, language containing bb or aa.
b) No:
As PDA`s are non-deterministic also but FA`s are not.
so it is not possible for FA to accept all the languages which are accepted by
PDA`s.there are non-regular languages which will be accepted by PDA`s e.g.
Language of double factorial which can’t be accepted by FA. Hence statement is
false
Post a Comment