deciability (automata presentation)
DESCRIPTION
A short presentation to share knowledge about topic Decidability of Theory of Automata Course. To make people to be aware how to know which formal languages are decidable and why...!TRANSCRIPT
![Page 1: Deciability (automata presentation)](https://reader034.vdocument.in/reader034/viewer/2022052400/559af89b1a28ab96458b473c/html5/thumbnails/1.jpg)
DECIDABILITYBy:
M.Daniyal Ashfaq (2013-CS-51)
Shahrukh Mahesar (2013-CS-32)
M.Waleed Aslam (2013-CS-14)
Sagar Kumar (2013-CS-39)
Section : 4A
To:
Mehwish Wahid
Theory of Automata & Formal Languages
Department of Computer Science
Sir Syed University of Engineering & Technology Karachi
![Page 2: Deciability (automata presentation)](https://reader034.vdocument.in/reader034/viewer/2022052400/559af89b1a28ab96458b473c/html5/thumbnails/2.jpg)
ContentsIntroduction
Advantages
Decidability in Automata
Types:
◦ Decidable
◦ Semi-Decidable
◦ Undecidable
Decidable Problems
◦ For C.F.L
◦ For F.A
Undecidable Problems
◦ For T.M
References
![Page 3: Deciability (automata presentation)](https://reader034.vdocument.in/reader034/viewer/2022052400/559af89b1a28ab96458b473c/html5/thumbnails/3.jpg)
Introduction
An Effective solution to a problem that has
“Yes” or “No” answer.
Having Decision procedure is known as
Decidable.
![Page 4: Deciability (automata presentation)](https://reader034.vdocument.in/reader034/viewer/2022052400/559af89b1a28ab96458b473c/html5/thumbnails/4.jpg)
Advantages
Determined Goal.
Strong Procedure.
More Accurate.
Time Saving.
![Page 5: Deciability (automata presentation)](https://reader034.vdocument.in/reader034/viewer/2022052400/559af89b1a28ab96458b473c/html5/thumbnails/5.jpg)
Decidability in Automata
An algorithm, determining the validity of a
given input.
Divided into three parts:
Decidable
Semi-decidable
Un-decidable
![Page 6: Deciability (automata presentation)](https://reader034.vdocument.in/reader034/viewer/2022052400/559af89b1a28ab96458b473c/html5/thumbnails/6.jpg)
Decidable
Existance of an effecive algorithm
Ability to determine whether an input is
acceptable or not.
![Page 7: Deciability (automata presentation)](https://reader034.vdocument.in/reader034/viewer/2022052400/559af89b1a28ab96458b473c/html5/thumbnails/7.jpg)
Semidecidable
Existance of an Algorithm, having effectiveness
in theory
Sometimes fail to determine exact answer
practically.
![Page 8: Deciability (automata presentation)](https://reader034.vdocument.in/reader034/viewer/2022052400/559af89b1a28ab96458b473c/html5/thumbnails/8.jpg)
Undecidable
Existing no effective algorithm
Solutions can not be determined
![Page 9: Deciability (automata presentation)](https://reader034.vdocument.in/reader034/viewer/2022052400/559af89b1a28ab96458b473c/html5/thumbnails/9.jpg)
Decidable
Problems(C.F.L)
Emptiness?
Finiteness?
Membership?
![Page 10: Deciability (automata presentation)](https://reader034.vdocument.in/reader034/viewer/2022052400/559af89b1a28ab96458b473c/html5/thumbnails/10.jpg)
Solution:-
Emptiness:
Convert CFG into CNF.
Finiteness:
Apply Pumping Lemma.
Membership:
Apply CYK algorithm on CNF form.
Hence CFL is Decidable.
Decidable
Problems(C.F.L)
![Page 11: Deciability (automata presentation)](https://reader034.vdocument.in/reader034/viewer/2022052400/559af89b1a28ab96458b473c/html5/thumbnails/11.jpg)
Decidable Problems(F.A)
Is the same Language accepted by two
different F.As?
Is the same Language defined by two different
R.Es?
![Page 12: Deciability (automata presentation)](https://reader034.vdocument.in/reader034/viewer/2022052400/559af89b1a28ab96458b473c/html5/thumbnails/12.jpg)
Solution:-
Convert both F.A’s into Regular Expression.
Get a minimum word Accepted by both.
Hence FA is Decidable.
Decidable Problems(F.A)
![Page 13: Deciability (automata presentation)](https://reader034.vdocument.in/reader034/viewer/2022052400/559af89b1a28ab96458b473c/html5/thumbnails/13.jpg)
Undecidable
Problem(T.M)
The Halting Problem?
Null Words?
Emptiness?
Finitess?
![Page 14: Deciability (automata presentation)](https://reader034.vdocument.in/reader034/viewer/2022052400/559af89b1a28ab96458b473c/html5/thumbnails/14.jpg)
Halting Problem:-
Machine Can be Modified for H.P.
Can’t be Accepted by Recurive Emurable.
Hence No Solution.
Undecidable
Problem(T.M)
![Page 15: Deciability (automata presentation)](https://reader034.vdocument.in/reader034/viewer/2022052400/559af89b1a28ab96458b473c/html5/thumbnails/15.jpg)
Null Words:No Solution.
• Emptiness:No Solution.
• Finiteness:No Solution.
• Hence T.M is Undecidable.
Undecidable
Problem(T.M)
![Page 16: Deciability (automata presentation)](https://reader034.vdocument.in/reader034/viewer/2022052400/559af89b1a28ab96458b473c/html5/thumbnails/16.jpg)
If People Knew How I Worked Hard, They
Would Never Get Surprised ~ Anonymous
![Page 17: Deciability (automata presentation)](https://reader034.vdocument.in/reader034/viewer/2022052400/559af89b1a28ab96458b473c/html5/thumbnails/17.jpg)
Books:1. Introduction To Computer Theory By Daniel I.A
Cohen.
2. An Introduction To Formal Languages and Automata By Peter Linz.
3. Introduction To Theory of Computation By Anil Maheshwari, Michiel Smid.
Websites:1. http://en.wikipedia.org/wiki/CYK_algorithm
2. http://en.wikipedia.org/wiki/Decidability
3. http://en.wikipedia.org/wiki/List_of_undecidable_problems
References
![Page 18: Deciability (automata presentation)](https://reader034.vdocument.in/reader034/viewer/2022052400/559af89b1a28ab96458b473c/html5/thumbnails/18.jpg)
Thank you
for
your patience!