This automaton consists of states (represented in the figure by
circles), and transitions (represented by arrows). As the automaton sees
a symbol of input, it makes a transition (or jump) to another state, according to its transition function (which takes the current state and the recent symbol as its inputs).
A finite-state machine (FSM) or finite-state automaton (plural: automata), or simply a state machine, is a behavioral model used to design computer programs. It is composed of a finite number of states associated to transitions. A transition is a set of actions that starts from one state and ends in another (or the same) state. A transition is started by a trigger, and a trigger can be an event or a condition.
In theoretical computer science, automata theory is the study of abstract machines (or more appropriately, abstract 'mathematical' machines or systems) and the computational problems that can be solved using these machines. These abstract machines are called automata. Automata comes from the Greek word αὐτόματα meaning "self-acting".
Basic Notation and terminologies used in FAFL
1.AlphabetA language consits of various symbols from which the words, statements can be obtained. These symbols are called alphabets. alphabet is defined as a finite non empty set of symbols. alphabets has the letters from A to Z, a to z, digits from 0 to 9, symbols such as + ,-, *, /,(,), {,}, etc . symbol Σ denotes the set of alphabets of a language.
The alphabets used by machine language is denoted { 0,1}
2. String
The sequence of symbols obtained from the alphabets of a language is called a string. a string is defined as a finite sequence of symbols from the alphabet Σ. Empty string is denoted by symbol epsilon ε. let Σ={0,1} is a set of alphabets. the various strings that can be obtained from Σ are { 0,1,00,01,10,11,01010,.....}
concatenation of string:
u and v be two strings .
u=a1a2a3.....an and v= b1b2b3....bm
then after concatenation of u and v we get
uv=a1a2a3....anb1b2b3....bm
No comments:
Post a Comment