100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Theoretical Computer Science II COS2601 Semester 1 School of Computing $7.49   Add to cart

Exam (elaborations)

Theoretical Computer Science II COS2601 Semester 1 School of Computing

 4 views  0 purchase
  • Course
  • Institution

Theoretical Computer Science II COS2601 Semester 1 School of Computing

Preview 2 out of 11  pages

  • March 8, 2022
  • 11
  • 2021/2022
  • Exam (elaborations)
  • Questions & answers
avatar-seller
COS2601/203/1/2017




Tutorial letter 203/1/2017

Theoretical Computer Science II
COS2601

Semester 1


School of Computing


Discussion of Assignment 3




BARCODE

, Dear student

Solutions to the questions of assignment 3 are provided in this tutorial letter.

Regards
COS2601 team

Question 1
Kleene’s theorem can be used to turn a transition graph (TG) into a regular expression. Which one of the
following regular expressions would generate a language that would be equivalent to the language
described by the following TG?




1. aab*a + bba*
2. (aa + bb)(b + a)*a
3. aabb(a + b)*a
4. (bba*)* + (aab*a)* + ba

Answer: Option 1

Discussion
The b-loop at x2 can be written as b* and the a-loop at x4 as a*.
One path from start to final state (x1 to x3) is thus: aab*a.
The second path from start to final state (x1 to x4) is thus: bba*.
The ba-edge from x1 to x5 can be ignored as it does not lead to a final state.

It is now simply a matter of combining these parts of the regular expression to get to
aab*a + bba*
From this, it is clear that option 1 is the correct option.

The other options misinterpret the paths to final states, often incorrectly concatenating paths.

Question 2
Given FA1 (with regular expression r1) and FA2 (with regular expression r2), a transition table is being put
together to build an FA for r1 + r2.

New state Read an a Read an b
-z1 +z2 z3
+z2




2

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

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

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

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 NURSMontero. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $7.49. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

78834 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling
$7.49
  • (0)
  Add to cart