Download presentation

Presentation is loading. Please wait.

Published byFernanda Barnaby Modified over 4 years ago

1
Applied Computer Science II Chapter 4: Decidability Prof. Dr. Luc De Raedt Institut für Informatik Albert-Ludwigs Universität Freiburg Germany

2
Overview An investigation into the solvable/decidable Decidable languages The halting problem (undecidable)

3
Decidable problems ? Acceptance problem : –decide whether an automaton accepts a string Equivalence problem : –Decide whether two automata are equivalent, i.e. accept the same language Emptiness testing problem : –Decide whether the language of an automaton is empty Can be applied to –DFA, NFA, REX, PDA, CFG, TM,…

4
The acceptance problem for DFAs

5
The acceptance problem for NFAs

6
The acceptance problem for Regular Expressions

7
The emptiness testing problem for DFAs

8
The equivalence problem for DFAs

9
Decidable problems for CF languages

13
The halting problem There is a specific problem that is algorithmically unsolvable (undecidable), e.g. the halting problem Philosophical implications : computers are fundamentally limited

15
Diagonalization Georg Cantor 1873 Measure the size of (infinite) sets

22
Summary

Similar presentations

Presentation is loading. Please wait....

OK

Courtesy Costas Busch - RPI1 Non Deterministic Automata.

Courtesy Costas Busch - RPI1 Non Deterministic Automata.

© 2018 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google