Automata
Theory of Automata Computation
Introduction:
In most fields of science, problem resolution is based on the use of formal models. A formal model deals with mathematical objects that represent abstractions of the real entities to be modelled.Formal models basically require to formalize the problem, i.e. to choose a language that describes it and to solve the formal problem by means of the tools provided by the chosen formalism Models play an essential role in computer science: Computer scientists need models to represent a computer system at different levels of abstraction , for understanding it , or designing it, or even using it. We introduce two fundamental classes of computer science models: automata and grammars.
Automata
Mechanical contrivances that once set in motion can continue to operate independently. Depending on the mechanism, the term is also sometimes used as a synonym for androids (machines that resemble human beings) and robots (devices designed to accomplish a task). Automata were often intended to be aesthetic as well as mechanical accomplishments, and they can be remarkable for the extent to which an inanimate object can convey convincingly the appearance of a living organism.
Definition of an Automaton
We shall give the most general definition of an automaton and later modify it to computer applications. An automaton is defined as a system where energy, materials and information’s are transformed, transmitted and used for
Performing some functions without direct human participation.
In computer science the term ‘automaton’ means “discrete automaton” and is defined in a more abstract way as shown.
i1 Q1
i2 Q2
i3 Q3...
View Full Essay
