First model of computation, Theory of Computation

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)

Posted Date: 3/20/2013 6:13:41 AM | Location : United States







Related Discussions:- First model of computation, Assignment Help, Ask Question on First model of computation, Get Answer, Expert's Help, First model of computation Discussions

Write discussion on First model of computation
Your posts are moderated
Related Questions
construct a social network from the real-world data, perform some simple network analyses using Gephi, and interpret the results.

What is the purpose of GDTR?

distinguish between histogram and historigram

The project 2 involves completing and modifying the C++ program that evaluates statements of an expression language contained in the Expression Interpreter that interprets fully pa

The objective of the remainder of this assignment is to get you thinking about the problem of recognizing strings given various restrictions to your model of computation. We will w

Find the Regular Grammar for the following Regular Expression: a(a+b)*(ab*+ba*)b.

For example, the question of whether a given regular language is positive (does not include the empty string) is algorithmically decidable. "Positiveness Problem". Note that

design a turing machine that accepts the language which consists of even number of zero''s and even number of one''s?

Describe the architecture of interface agency

constract context free g ={ a^n b^m : m,n >=0 and n