Samenvatting Hoofdstuk 11: A Hierarchy of Formal Languages and Automata
6 views 0 purchase
Course
Automaten en Berekenbaarheid
Institution
Vrije Universiteit Brussel (VUB)
Book
An Introduction to Formal Languages and Automata
Dit is de samenvatting van het elfde hoofdstuk van het vak Automaten en Berekenbaarheid. In deze samenvatting werd alle relevante informatie uit de slides alsook uit eigen notities opgenomen.
Eindresultaat: 16/20
Hoofdstuk 11: A hierarchy of formal
languages and automata
Inhoud:
• Relation between Turing machines and languages
• Is every language determined by some Turing machine?
• Hierarchy of languages and grammars
1 Recursive(ly enumerable) languages
Bij beslisbare taal → stopt in niet finale state indien woord niet geaccepteerd wordt
Semi-beslisbaar → loopt voor eeuwig indien woord niet geaccepteerd wordt.
2 Enumerating languages
• Can you enumerate all elements of recursive language?
• What about a recursively enumerable language?
2.1 Are all languages recursively enumerable?
Stelling:
For any non-empty alphabet, there exists a language that is not recursively enumerable.
Bewijs:
In hoofdstuk 10 aangetoond dat er eindig aantal TM zijn over een gegeven alfabet. Er zijn echter
oneindig veel talen over een gegeven niet leeg alfabet. Verder accepteert een TM maar 1 taal
waardoor er dus voor elk niet leeg alfabet minstens een taal zal bestaan die we niet met een TM
kunnen accepteren.
• This means that there exist languages for which we cannot even write a program that
accepts them.
• This means that there are computational problems we cannot solve with a computer (more
on that next chapter)
1
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller lennyS. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $3.74. You're not tied to anything after your purchase.
