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
A context free grammar G = (N, Σ, P, S)  is in binary form if for all productions A we have |α| ≤ 2. In addition we say that G is in Chomsky Normaml Form (CNF) if it is in bi

The SL 2 languages are speci?ed with a set of 2-factors in Σ 2 (plus some factors in {?}Σ and some factors in Σ{?} distinguishing symbols that may occur at the beginning and en

The path function δ : Q × Σ*→ P(Q) is the extension of δ to strings: Again, this just says that to ?nd the set of states reachable by a path labeled w from a state q in an

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

We have now de?ned classes of k-local languages for all k ≥ 2. Together, these classes form the Strictly Local Languages in general. De?nition (Strictly Local Languages) A langu

Kleene called this the Synthesis theorem because his (and your) proof gives an effective procedure for synthesizing an automaton that recognizes the language denoted by any given r

let G=(V,T,S,P) where V={a,b,A,B,S}, T={a,b},S the start symbol and P={S->Aba, A->BB, B->ab,AB->b} 1.show the derivation sentence for the string ababba 2. find a sentential form

proof ogdens lemma .with example i am not able to undestand the meaning of distinguished position .

The Recognition Problem for a class of languages is the question of whether a given string is a member of a given language. An instance consists of a string and a (?nite) speci?cat

The fact that the Recognition Problem is decidable gives us another algorithm for deciding Emptiness. The pumping lemma tells us that if every string x ∈ L(A) which has length grea