CSE Corner

# The term "Automata" is derived from the Greek word, which means "self-acting". An automaton (Automata in plural) is an abstract self-propelled computing device which follows a predetermined sequence of operations automatically. An automaton with a finite number of states is called a Finite Automaton (FA) or Finite State Machine (FSM).

click

. DFA NFA It is called deterministic finite automata It is called non-deterministic finite automata For Every symbol of the alphabet, there is only one state transition in DFA. We do not need to specify how does the NFA react according to some symbol. DFA cannot use Empty String transition. NFA can use Empty String transition. ...

Here are some reasons to study automata theory in computer science . Introducation to finite automata Structural Representation Automata and Complexity Introducation to Finite Automata Finite automata are a useful model for many kinds of hardware and software. Software for designing and checking the behaviour of digital circuits The 'Lexical Analyzer' of a typical compiler, that is .. the compiler components that break the inputs text into logical units, such as: identifiers,keywords and punctuations. Software for scanning large bodies of text ,such as: collections of web pages , to find occurences of words, phrases or other patterns . Software for varifying systems of all types ,that have finite number of distinct states such as: communications protocols or protocols for secure exchange of information.  Structural Representation There are two important notations play an important role in the study of automata and their applications. Gram...

Each model in automata theory plays important roles in several applied areas.  Finite automata  are used in text processing, compilers, and hardware design.

pdf book viewer অনলাইন বই পাঠে আপনাকে স্বাগতম !!! পৃথিবী এগিয়ে যাচ্ছে , চলুন আমরাও এক ধাপ এগিয়ে যাই । সব কিছু কে নিয়ে আসি আদরের চারকোণা টাচ স্ক্রিনে ! বই পড়ার জন্য ক্লিক করুন

.. Symbol The symbol is the smallest building block in the theory of computation and can be any letter, number or even pictograms. For example: a, b, 0, 1 Alphabet From the symbols we can form an alphabet represented by the sigma sign (Σ). The alphabet is nothing more than a finite set of collection of symbols. For example: Σ = {a,b}{0,1} String A string is a sequence of symbols from the alphabet. For example: Σ = {a,b} Possible strings are: String "a" of length 1 String "b" of length 1 String "aa" of length 2 String "ab" of length 2 String "aaa" of length 3 Question: How many strings of length 2 are possible over alphabet {a,b}? Answer: 4. The strings are: aa, ab, ba and bb ...

. Computer Computation Computation is any type of calculation that includes both arithmetical and non-arithmetical steps and follows a well-defined model, for example an algorithm. The study of computation is paramount to the discipline of computer science. Theory of Computation Introduction of Theory of Computation. Theory Of Computation is a theoretical branch of Computer Science and Mathematics, which mainly deals with the logic of computation with respect to simple machines, referred to as automata. What is Automata ??? noun form :Automaton. plural form:Automa which means... A machine which performs a range of functions accordin...