Automata, Theory of Computation

Assignment Help:

As we are primarily concerned with questions of what is and what is not computable relative to some particular model of computation, we will usually base our explorations of languages on abstract automata. These are "checking machines" in which the input is a string over some speci?c alphabet. We say such a machine accepts a string if the computation on that input results in a TRUE output. We say that it recognizes a language if it accepts all and only the strings in that language.

Generally, in exploring a class of languages, we will de?ne a class of automata that recognize all and only the languages in the class-a particular sort of automaton, the peculiarities of which exactly capture the characteristics of the class of languages. We say the class of automata characterizes the class of languages. We will actually go about this both ways. Sometimes we will de?ne the class of languages ?rst, as we have in the case of the Finite Languages, and then look for a class of automata that characterize it. Other times we will specify the automata ?rst (by, for instance, modifying a previously de?ned class) and will then look for the class of languages it characterizes. We will use the same general methods no matter which way we are working.

The de?nition of the class of automata will specify the resources the machine provides along with a general algorithm for employing those resources to recognize languages in the class. The details that specialize that algorithm for a particular language are left as parameters. The only restriction on the nature of these parameters is that there must be ?nitely many of them and they must range over ?nite objects.


Related Discussions:- Automata

Pushdown automator, draw pda for l={an,bm,an/m,n>=0} n is in superscript

draw pda for l={an,bm,an/m,n>=0} n is in superscript

Computations of sl automata, We will specify a computation of one of these ...

We will specify a computation of one of these automata by specifying the pair of the symbols that are in the window and the remainder of the string to the right of the window at ea

Instantaneous description of an fsa, De?nition Instantaneous Description of...

De?nition Instantaneous Description of an FSA: An instantaneous description (ID) of a FSA A = (Q,Σ, T, q 0 , F) is a pair (q,w) ∈ Q×Σ* , where q the current state and w is the p

Theory of computation, Computations are deliberate for processing informati...

Computations are deliberate for processing information. Computability theory was discovered in the 1930s, and extended in the 1950s and 1960s. Its basic ideas have become part of

Gastric juice, what are composition and its function of gastric juice

what are composition and its function of gastric juice

Non-determinism - recognizable language, Our DFAs are required to have exac...

Our DFAs are required to have exactly one edge incident from each state for each input symbol so there is a unique next state for every current state and input symbol. Thus, the ne

Pendulum Swings, how many pendulum swings will it take to walk across the c...

how many pendulum swings will it take to walk across the classroom?

Decision problems of regular languages, We'll close our consideration of re...

We'll close our consideration of regular languages by looking at whether (certain) problems about regular languages are algorithmically decidable.

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