Samenvatting Hoofdstuk 3: Regular Languages and Regular Grammars
15 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 derde 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 3: Regular languages and
regular grammars
1 Reguliere expressies
Definitie:
Let Σ be a given alphabet. Then regular expressions are defined inductively as follows:
1.1 Languages associated with regular expressions
1
, 2
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.73. You're not tied to anything after your purchase.