How many states would the dfa have

Assignment Help Theory of Computation
Reference no: EM132104992

Problem : Smaller NFA

In this problem we'll see a very clear example of how NFAs can be built to recognize a language using much fewer states than a DFA would. Consider the following language L: 'Strings of a's, b's, and c's, that do NOT contain at least one of those 3 letters.'

So for example, accca would be accepted, because it does not contain b, as would bbc which does not contain any a's, and bb winch does not contain any a's or c's, but caba would be rejected because it contains all 3 letters of the alphabet in it.

Build a DFA with at most 8 states that recognizes L.

Build an NFA with at most 4 states that recognizes L.

If instead of 3 letters, your alphabet had k letters, and you build a DFA and an NFA for the language the same way you built them in parts a and b, how many states would the DFA have? How' many states would the NFA have?

Reference no: EM132104992

Questions Cloud

Find out the additional business : Assume there is sufficient capacity for the special order. How do i use differential analysis to find out if the additional business should be accepted or rejec
Give a new yes-instance of problem partition : Can the multi-set S be partitioned into two multi-sets Sa and Sb such that the sum of the integers in Sa is exactly equal to the sum of the integers in Sb.
What amount will accounts receivable be shown : In Razz's budgeted balance sheet at December 31, at what amount will accounts receivable be shown
What are the major challenges fund managers : What are the major challenges fund managers face when they try to raise money?
How many states would the dfa have : If instead of 3 letters, your alphabet had k letters, and you build a DFA and an NFA for the language the same way you built them in parts a and b.
Reporting increase an investment value : Does the use of the accelerated depreciation method (instead of straight line) for income tax reporting increase an investment's value?
Account balances of two accounts : The change in the account balances of these two accounts resulted in total expenses:
Explore the use of a one-time pad version of vigenere cipher : Encrypt the plaintext sendmoremoney with the key stream 2 9 0 1 7 23 15 21 14 11 11 2 8 9 using the ciphertext produced find a key.
What is th capm beta of the portfolio : What is the expected return on a portfolio that has R6000 invested in the risk free security and R4000 invested in the market portfolio?

Reviews

Write a Review

Theory of Computation Questions & Answers

  Write a job description for each member of a three-person

write a job description for each member of a three-person virtual team tasked to improve company morale the virtual

  Create a parser to check expression for allowable form

Find out its grammatical structure with respect to given formal grammar. You are needed to create a parser which will check expression for allowable form.

  The roommate problem and intern assignment problem

Implementation of both the algorithms using C/C++ code 1. roommates problem 2. Intern Problem

  What is collaborative ?ltering

What are we referring to when we talk about a secondary use of data and What is collaborative ?ltering? Who uses it?

  Compute a shortest superstring

Dynamic programming algorithm to compute a shortest superstring.

  Imply the conclusion

Use rules of inference to show that the hypotheses "If it does not rain or if it is not foggy, then the sailing race will be held and the lifesaving demonstration will go on,

  What is backus-naur form

Give an example of the Backus-Naur form of the grammar for a subset of English of your choice.

  Define a phrase-structure grammar

What does it mean for a string to be derivable from a string w by a phrase-structure grammar G?

  Use undecidability of allcfg to show problem is undecidable

Use undecidability of ALLCFG to illustrate that following problem is also undecidable: Given PDA M1 and FA M2, is L(M1) = L(M2)?

  Construct a finite-state automaton

Construct a finite-state automaton that recognizes the set of bit strings consisting of a 0 followed by a string with an odd number of 1s.

  Write grammar for language consisting of strings

Write a grammar for the language consisting of strings that have n copies of the letter a followed by same number of copies of the letter b, where n>0

  Prove that the languages are not regular

Prove that the subsequent languages are not regular using the pumping lemma. Use 'N' as the pumping lemma constant, to differentiate from the lowercase n used in parts a and b.

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd