Finite Automata for 3 Unique Input Characters with 3 equal occurrences

Regular price
Sale price
Regular price
Sold out
Unit price
Shipping calculated at checkout.


Theory of Computation is a core subject in Computer Science and Engineering. The abstract machines like Finite Automata, Pushdown Automata and Turing Machine these are the basis for today’s computer. As Theory of Computation is mathematics oriented subject, for acquiring knowledge in this we need strong mathematical analysis skill. The problems presented in the prescribed book may be limited. But it is possible to create crores of problems in each abstract machine. This book focuses on the topic, construction of finite automata that accepts three unique input characters with three equal occurrences for an unordered input. As three unique input characters are used with three occurrences the total level will be 3*3=9. In each level, we will be having some states. In the first level, the number of states is 4. In the second level, it is thirteen. In the consecutive level, it will be 40, 121, 364, 1093, 3280, 9841, 29524. Totally 1680 combinations are possible with the first possible final state is 10218 and the final possible final state is 29146. This concept is a combination of the theory of computation and permutation & combinatorics.


EZHILARASU Umadevi Palani


Dr P. Ezhilarasu received a B.E. (CSE) from Bharathiar University Coimbatore; He then received a M.E.(CSE) from Anna University Chennai. He commended his Ph.D in the Faculty of Information and Communication from the same university. He is having 2 decades of academic experience with more than 70 publications. He is having membership in IE, ISTE.


MAHAPATRA Rajendra Prasad


Number of Pages:


Book language:


Published On:




Publishing House:

LAP LAMBERT Academic Publishing


Finite Automata, Theory of Computation, 3 unique input characters, 3 equal occurrences

Product category: