100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Previously searched by you
Previously searched by you
logo
COS3701 Assignment 3 memo 2024 CA$11.22   Add to cart
Quickly navigate to
Preview
  2.  
  3. University Of South Africa (Unisa)
  4.  
  5. Theoretical Computer Science III (COS3701)

Other

COS3701 Assignment 3 memo 2024

2 reviews
 197 views  31 purchases
  • Course
  • Theoretical Computer Science III (COS3701)
  • Institution
  • University Of South Africa (Unisa)

COS3701 Assignment 3 memo 2024: Material to be tested: Cohen, Chapter 19, 21 - 25 Question 1 [10] Build/design a Turing machine (TM) that determines whether a given word contains at least one insta...

[Show more]

Preview 2 out of 6  pages

Document information

  • August 28, 2024
  • 6
  • 2024/2025
  • Other
  • Unknown

Subjects

  • cos3701

Written for

  • University of South Africa (Unisa)
  • Theoretical Computer Science III (COS3701)
All documents for this subject (14)

2  reviews

review-writer-avatar

By: bradjame • 2 months ago

review-writer-avatar

By: kyle0180howard • 2 months ago

reply-writer-avatar

By: CrystalIndigo • 2 months ago

Hie, may we know the reason for this review so that we improve in the future

Seller

avatar-seller
CrystalIndigo

Reviews received

Content preview

COS3701 Assignment 3 memo 2024
Detailed complete explanation and everything that is needed


Crystal Indigo!
Crystal Indigo!
Providing all solutions you need anytime
+27 76 626 8187

, Question 1 Build/design a Turing machine (TM) that determines whether
a given word contains at least one instance of the substring aab. If it
does, then the TM should write a T on the tape after the input word

Explanation:
This TM checks whether a given word contains the substring "aab". If the substring is found, it
writes "T" on the tape after the input word.
• States and Transitions: The TM starts in an initial state, it start with either an "a" or "b". It
reads the input symbols one by one, looking for the sequence "aab". If it finds "a", it stays in
the current state; when it sees another "a", it might move to a new state. Upon seeing "b"
after two "a"s, it transitions to a state where it will write "T" after the word.
• Halting: The TM halts once it has written "T" on the tape, signaling that the substring was
found.




Question 2 Build/design a TM that:

· accepts all words that start with an a, and ends with a b,

· loops forever on all words that start with a b, and

· rejects all other words.

Explanation:
This TM accepts words that start with an "a" and end with a "b". It loops forever on words that start
with a "b" and rejects all other words.
• States and Transitions: For words starting with "a" and ending with "b", the TM transitions
through states that validate the sequence. If it encounters an invalid pattern, it either loops
(in case of starting with "b") or moves to a reject state.
• Looping: For words starting with "b", it keeps the TM in a loop without ever reaching a
halting state.

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

Will I be stuck with a subscription?

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

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

81113 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
CA$11.22  31x  sold
  • (2)
  Add to cart