How to solve the checking problem, Theory of Computation

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 work with whatever representation of an algorithm you are comfortable with (C or Pascal or, perhaps, some form of pseudo-code-just make sure it is unambiguous). Don't get too carried away with this. You only have a short time to work on it. The goal is primarily to think about this stu?, not to agonize over it. Whatever you do, don't turn it into a programming assignment; running code is not a bonus in this case.

In all of the problems we will assume the same basic machine:

• The program is read-only (it can't be modi?ed, you might even think of it as being hard-wired).

• For the sake of uniformity, let's assume the following methods for accessing the input:

- input(), a function that returns the current input character. You can use this in forms like

i ← input(), or

if (input() = ‘a' ) then . . . , or


This does not consume the character; any subsequent calls to input() prior to a call to next() will return the same character. You may assume that input() returns a unique value EOF if all of the input has been consumed.

- next(), a function that bumps to the next position in the input.

This discards the previous character which cannot be re-read. You can either assume that it returns nothing or that it returns TRUE in the case the input is not at EOF and FALSE otherwise.

Posted Date: 3/20/2013 6:08:24 AM | Location : United States

Related Discussions:- How to solve the checking problem, Assignment Help, Ask Question on How to solve the checking problem, Get Answer, Expert's Help, How to solve the checking problem Discussions

Write discussion on How to solve the checking problem
Your posts are moderated
Related Questions
And what this money. Invovle who it involves and the fact of,how we got itself identified candidate and not withstanding time date location. That shouts me media And answers who''v

Construct a PDA that accepts { x#y | x, y in {a, b}* such that x ? y and xi = yi for some i, 1 = i = min(|x|, |y|) }. For your PDA to work correctly it will need to be non-determin

#can you solve a problem of palindrome using turing machine with explanation and diagrams?

Another way of interpreting a strictly local automaton is as a generator: a mechanism for building strings which is restricted to building all and only the automaton as an inexh

Sketch an algorithm for the universal recognition problem for SL 2 . This takes an automaton and a string and returns TRUE if the string is accepted by the automaton, FALSE otherwi

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

Strictly 2-local automata are based on lookup tables that are sets of 2-factors, the pairs of adjacent symbols which are permitted to occur in a word. To generalize, we extend the

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

S-->AAA|B A-->aA|B B-->epsilon

Find a regular expression for the regular language L={w | w is decimal notation for an integer that is a multiple of 4}