First model of computation, Theory of Computation

Assignment Help:

Computer has a single unbounded precision counter which you can only increment, decrement and test for zero. (You may assume that it is initially zero or you may include an explicit instruction to clear.) Limit your program to a single unsigned integer variable, and limit your methods of accessing it to something like inc(i), dec(i) and a predicate zero?(i) which returns true i? i = 0. This integer has unbounded precision-it can range over the entire set of natural numbers-so you never have to worry about your counter over?owing. It is, however, restricted to only the natural numbers-it cannot go negative, so you cannot decrement past zero.

(a) Sketch an algorithm to recognize the language: {aibi| i ≥ 0}. This is the set of strings consisting of zero or more ‘a's followed by exactly the same number of ‘b's.

(b) Can you do this within the ?rst model of computation? Either sketch an algorithm to do it, or make an informal argument thatit can't be  done.

(c) Give an informal argument that one can't recognize the language: {aibici| i ≥ 0} within this second model of computation (i.e, with
a single counter)


Related Discussions:- First model of computation

Prepare the consolidated financial statements, Prepare the consolidated fin...

Prepare the consolidated financial statements for the year ended 30 June 2011. On 1 July 2006, Mark Ltd acquired all the share capitall of john Ltd for $700,000. At the date , J

Brain game, If the first three words are the boys down,what are the last th...

If the first three words are the boys down,what are the last three words??

#titl, matlab v matlab

matlab v matlab

Gephi, construct a social network from the real-world data, perform some si...

construct a social network from the real-world data, perform some simple network analyses using Gephi, and interpret the results.

Computation and languages, When we study computability we are studying prob...

When we study computability we are studying problems in an abstract sense. For example, addition is the problem of, having been given two numbers, returning a third number that is

Normal forms, how to convert a grammar into GNF

how to convert a grammar into GNF

Prove the arden''s theorem, State and Prove the Arden's theorem for Regular...

State and Prove the Arden's theorem for Regular Expression

Pumping lemma constant, a) Let n be the pumping lemma constant. Then if L i...

a) Let n be the pumping lemma constant. Then if L is regular, PL implies that s can be decomposed into xyz, |y| > 0, |xy| ≤n, such that xy i z is in L for all i ≥0. Since the le

Formal languages and grammar, The universe of strings is a very useful medi...

The universe of strings is a very useful medium for the representation of information as long as there exists a function that provides the interpretation for the information carrie

Vogel Approximation Method(VAM, how to write program Minimum Cost Calculat...

how to write program Minimum Cost Calculation - Vogel Approximation Method(VAM

Write Your Message!

Captcha
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