Automata

1. Who is the Father of Computer Science?
Alan Turing, the Father of Computer Science

Not only is Alan Turing the father of all modern computer science, he also was the single individual most responsible for breaking the Enigma code during World War II, and he laid the foundation for artificial intelligence by posing the Turing Test in 1950.

Unfortunately, Alan Turing was also terribly persecuted for the "crime" of being a homosexual. He was arrested in 1952 for having sex with another man. It pains me greatly to read about the degrading and inhumane treatment one of our greatest scientific minds was subjected to. Alan Turing ultimately committed suicide not long afterwards at the age of 42.

The "nobel prize of computing" was founded in Turing's name in 1966. Reading the list of Turing Award recipients is humbling indeed, a reminder of not only how far we've come, but how far we have to go.

2: Automata/Automation

• The Automata word has come out from Automatic,And Automata is a machine language

In theoretical computer science, automata theory is the study of abstract machines and problems which they are able to solve. Automata theory is closely related to formal language theory as the automata are often classified by the class of formal languages they are able to recognize.

• An automaton is a mathematical model for a finite state machine (FSM). A FSM is a machine that, given an input of symbols, "jumps", or transitions, through a series of states according to a transition function (which can be expressed as a table). In the common "Mealy" variety of FSMs, this transition function tells the automaton which state to go to next given a current state and a current symbol.

1. To introduce formal concepts of automata, grammars and languages.
2. To introduce ideas of computability and decidability.
3. To illustrate the importance of automata, formal language theory and general models of computation in Computer Science and Artificial Intelligence.

3. Applications of Automata

• Cellular automata, for the modelling of physical systems
• Weighted automata, for image processing
• Learning automata, for artificial intelligence applications
• Symmetrical difference NFAs, for random number generation, cryptology and circuit design.
• Chart-based automata, for object oriented modelling (ROOM), GUI design and test case generation, embedded system design, control systems.
• Automata in pattern matching
• Automata in graphics animation
• Automata in compiling and NLP
• Automata in protocol implementation
• Automata in Operations Research (max,+), (min,+)

source:http://www.codinghorror.com
www.wikipedia.com