This document discusses the theory of automata. It defines key concepts like automata, languages, strings, alphabets, and finite state automata. Specifically, it defines an automata as an abstract or non-physical model. It also defines languages as collections of strings over a finite alphabet and strings as sequences of symbols from an alphabet. Finite state automata are defined as models that have a finite number of states and transitions between those states based on inputs. Deterministic finite automata are defined as a 5-tuple with states, inputs, transitions, initial state, and accepting states.
This document discusses the theory of automata. It defines key concepts like automata, languages, strings, alphabets, and finite state automata. Specifically, it defines an automata as an abstract or non-physical model. It also defines languages as collections of strings over a finite alphabet and strings as sequences of symbols from an alphabet. Finite state automata are defined as models that have a finite number of states and transitions between those states based on inputs. Deterministic finite automata are defined as a 5-tuple with states, inputs, transitions, initial state, and accepting states.
This document discusses the theory of automata. It defines key concepts like automata, languages, strings, alphabets, and finite state automata. Specifically, it defines an automata as an abstract or non-physical model. It also defines languages as collections of strings over a finite alphabet and strings as sequences of symbols from an alphabet. Finite state automata are defined as models that have a finite number of states and transitions between those states based on inputs. Deterministic finite automata are defined as a 5-tuple with states, inputs, transitions, initial state, and accepting states.
This document discusses the theory of automata. It defines key concepts like automata, languages, strings, alphabets, and finite state automata. Specifically, it defines an automata as an abstract or non-physical model. It also defines languages as collections of strings over a finite alphabet and strings as sequences of symbols from an alphabet. Finite state automata are defined as models that have a finite number of states and transitions between those states based on inputs. Deterministic finite automata are defined as a 5-tuple with states, inputs, transitions, initial state, and accepting states.
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1/ 12
v Intro
Assignment of Theory of automata By Soonha soomro From Computer science department Roll no 2k21/lcs/41 Submitted to Sir Abdullah niaz shaikh THEORY OF AUTOMATA Automata The word Automata refers to the Automatic Machines, Machines which are abstract or non-physical Models Now Theory of automata Is the theoretical study of Abstract Machines, the designs, languages and computational problems.
Language The Collection of strings known as Language.
String Set of Alphabets known as a String. (A Set may contains one or more letters) i.e. (a, b, aaa, abb, aab, aba,… )
Alphabet Collection of letters known as Alphabet Which is denoted by ∑ read as Sigma
Letter Letters are the symbols or characters which are used to create a Language for Machine.
Power of alphabet The power of Alphabet denotes the length of string that how many letters a string can contain i.e. ∑ (b,c)2 =(b,c) (b,c) =(bb,bc,cb,cc)
Power of String It tells that how many times a particular letter of string is written. i.e. ( a2) = (a.a) or (aa) ( b3) = ( bbb)
Reverse string Reverse string is obtained by writing the symbols in reverse order. It is denoted by Res( s) / Res( w) / Sr / wr i.e. ( abc) Sr = (cba)
Empty string A string which contains no / zero letters is said to be an Empty or Null String. Denoted by € (epsilon) Length of String The number of symbols / letters a String contains is said to be the length of a String. i.e. (aa, ab, aa, bb) In the above example, each string contains 2 characters it means the length of String is 2.
*1 First Make a language for machine with all possible
strings from alphabet {abc} then 2 write the strings which starts with c and ends with a of the length 3 1 (aaa, aab, aac,aba, abb, abc,aca, acb, acc baa, bab, bac, bba, bbb, bbc, bca, bcb, bcc, caa, cab, cac, cba, cbb, cbc, cca, ccb, ccc) 2 ( caa,cba,cca ) Language A language is a collection of sentences of finite length all constructed from a finite alphabet of symbols. Example: If the language takes all possible strings of length 2 over ∑={a,b} then L={aa,ab,ba,bb} Language is divided into two aspects 1. Informal Language 2. Formal Language
1. Informal language Informal Language gives us proper Sense and can be understood easily. It contains all the words which follow English language’s rule and regulations. It is a semantic language. For instance: 1. Catch, hold, minute (make sense) 2. Toks, Ascek ,Joudl (doesn’t make any sense) 2. formal language A Language concerned with rules and syntax. In formal language it doesn’t matter whether the strings makes sense or not. It has predefined symbols and strings. It is a syntactic language. For instance: Define a language that starts with a and ends d. Abcd, aaad, azbd, acd.
Kleen star/ Operator
It is undetermined power that gives the infinite set of all possible length length over ∑ including null Example: If ∑ ={a,b}, ∑ * ={€,a , b , aa, ab, ba, …}
Kleen Plus The Set ∑+ is the infinite set of all possible lengths over ∑ excluding null. Example: If ∑={a,b }, ∑+ ={a,b,aa,ab,ba, …} Lexicographic order It’s a method of arranging a language in a sequence so that the strings of shortest length come first. ∑={a,b}* = {€, a, b, aa, ab, ba , bb, aaa, …}
Methods of defining languages
1. Descriptive In this method condition can be made by its strings. Example: Language Name={Definition} L1= {Any finite set that starts with a } L2= {All set of strings of letters that starts with a and ends with b}
2. Recursive In this method condition can be made by three rules. a) Specify some basic objects in the set that must be finite. b) It gives us finite number of rules for constructing more objects in a set. c) It describes that no object except those constructed with R1 and R2 are allowed in the set. d)
s={2,4,6,8,…} R1: 2 is in s R2: if 2 is in s then w is x+2. R3: follow R1 and R2
Finite automata A finite Automata is a model that has a finite set of states (represented in the figure by circles) and its control moves from one state to another state in response to external inputs (represented by arrows). Finite Automata can be broadly classified into two types 1. Finite Automata without output a) Deterministic Finite Automata b) Non Deterministic Finite Automata
2. Finite Automata with output
a) Moore machine b) Mealy machine Deterministic Finite automata A Deterministic Finite Automata (DFA) is defined as 5-tuple (Q , ∑ , δ , q° , F) Q is a finite and non-empty set of states ∑ is a finite set of input alphabets δ is a transition function q° is an initial state F is a set of final state Regular language A language is said to be Regular if there exist a regular expression to represent it. Regular Expression Regular Expression is a way of Representing Regular Language. In other words, Regular Expression is nothing nut a expression of strings and operators like 1) * Kleen closure/ star a* 2) + Positive Closure/ Kleen positive a+ 3) . Concatenations a.b 4) + Union (a+b)
II/III Semester 5 Year B.A.LL.B. (Maj.-Min.) (Old) Examination, December 2016 Major (Paper - 2) : Minor - I (Paper - 2) : SOCIOLOGY (Indian Society: Continuity and Change)
II/III Semester 5 Year B.A.LL.B. (Maj.-Min.) (Old) Examination, December 2016 Major (Paper - 2) : Minor - I (Paper - 2) : SOCIOLOGY (Indian Society: Continuity and Change)
