Finite Automata and Formal Languages : A Simple Approach

Finite Automata And Formal Languages: A Simple Approach begins with an introduction to finite automata, then goes into DFA design techniques, finite automata and regular expressions, regular languages and their properties, types of context-free grammar and languages, properties of context-free languages, pushdown automata, undecidability, and Turing Machines. Automata are the mathematical abstractions of computing machines. These abstractions are used to help students understand the fundamentals of the workings of electronic computing devices. Finite State Machine or Finite Automata is a mathematical model of a computing machine that can only be in one of a finite number of states at a time. This state is called the current state. The state of the machine can be changed by a triggering event and this switch is called a transition. A Finite Automata is clearly defined by its finite number of possible states and the conditions or events that initiate a transition. The Finite Automata is limited in its functionality and computing power than a more powerful model like the Turing Machine. The Finite State Machine is useful in representing machines that perform a limited number of actions based on a set of predetermined conditions. Some practical examples of Finite Automata are vending machines, traffic lights, and elevators. Finite Automata are useful as abstract models for analyzing and representing communication protocols, electronic design automation, and language parsing. They have even been used to model neurological systems. Finite Automata And Formal Languages: A Simple Approach describes finite state machines and their practical applications in a clear and simple manner. The material is designed to make it ideal for self-learning. With a large number of flowcharts, algorithms, and complete programs.