Show that all binary strings generated

Assignment Help Theory of Computation
Reference no: EM131316096

a) Show that all binary strings generated by the following grammar have values divisible by 3. Hint. Use induction on the number of nodes in a parse tree.

num -> 11 | 1001 | num 0 | num num

b) Does the grammar generate all binary strings with values divisible by 3?

Reference no: EM131316096

Questions Cloud

Statistically and clinically significant evidence : What is the difference between statistically significant evidence and clinically significant evidence? How would each of these findings be used to advance an evidenced-based project
Does the injured bystander-offender have a civil claim : Assume that community corrections officers use mace to subdue an unruly offender who is in custody awaiting a state probation revocation hearing. The mace drifts into an adjoining area, causing another alleged probation violator to have a serious ..
Find magnetic field intensities adjacent to current sheet : An infinite plane sheet lying in the plane carries a current of nonuniform density
Democracies are more transparent than nondemocracies : We say that democracies are more transparent than nondemocracies.
Show that all binary strings generated : Show that all binary strings generated by the following grammar have values divisible by 3.- Does the grammar generate all binary strings with values divisible by 3?
Solve their disagreements through bargaining : Why do states usually try to solve their disagreements through bargaining? War is a costly option that states would rather avoid if possible. States use the negotiation period to prepare surprise attacks against their opponents.
War occurs frequently between powerful countries : War occurs frequently between powerful countries. War occurs frequently between developing countries. Recently, civil wars have been less frequent than interstate wars. War tends to occur when states rely too much on diplomacy. War occurs infrequentl..
Coupon bonds on the market-effective annual yield : One More Time Software has 9.4 percent coupon bonds on the market with 19 years to maturity. The bonds make semiannual payments and currently sell for 120.2 percent of par. What is the current yield on the bonds? The effective annual yield?
Understanding of the nutritional support during pregnancy : The main purpose of this RP is to critically reflect your understanding of the "Nutritional support during pregnancy" This RP must have 6 pages, including cover page and references, and be presented on APA format

Reviews

Write a Review

Theory of Computation Questions & Answers

  Explain declarative knowledge and procedural knowledge

Write some examples of declarative knowledge. Write some examples of procedural knowledge. Then, compare examples, highlighting the similarities & differences.

  1 firstly critically discuss how job design can contribute

1. firstly critically discuss how job design can contribute to the growth and development of the individual skill

  Deterministic finite state machine

Determine, formally, whether L(R1(R1 + R2)*) = L((R1 + R2)*). That is, if it is true, provide a proof; otherwise provide a counter example.It is a well known result that every PDA with acceptance condition of an empty stack and reachability of a fin..

  Design deterministic finite state transducers

Design deterministic finite state transducers that implement the subsequent context sensitive rules:

  Use algorithm np completeness of any of the problems

Use any algorithm we without writing out details of algorithm. In proving problem NP-complete, you may utilize NP completeness of any of the problems.

  Explanation of turing machine

Devise a Turing machine with input given in unary notation such that the equipments produces the following output, 0 if x is divisible by 4,

  Compute a shortest superstring

Dynamic programming algorithm to compute a shortest superstring.

  Which phase of a compiler would give you a syntax error

Discuss the following questions relative to compilers: Which phase of a compiler would give you a syntax error? Which phase complains about undefined variables?

  Question 1show via chains of equivalences that the

question 1show via chains of equivalences that the following propositions are tautologies.a p and q rarr p harr qb p or

  Show that if the statement is true

Show that if the statement P(n) is true for infinitely many positive integers, and the implication P(n+1) ---> P(n) is true for all n>=1, then P(n) is true for all positive integers.

  Prove using the pumping lemma and closure properties

Prove using the pumping lemma and closure properties that the languages below are not regular. You can use the game argument provided in class.

  Implement finite state machine to recognze input string

Write implememnt finite state machine which recognzes input string according to following rules. First character should be either letter(upper or lower case.)

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