DFA that Accepts the Set of All Strings of 0's and 1's, such that Each Block of 5 Digits has atleast 2 0's

Abstract

Automata theory (also known as 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. Automata enables scientists to understand how machines compute the functions and solve problems. The main motivation behind developing Automata Theory was to develop methods to describe and analyze the dynamic behavior of discrete systems.  Finite automata are employed in pattern-matching and recognition tasks. They can be used to search for specific patterns or sequences of characters within a given input. Applications include text processing, string matching, and searching algorithms.It has been clearly known that there has been difficulty in understanding the concepts of Finite Automaton. Many people face difficulty in understanding the construction of a DFA. This article analyses about the different papers that has been published related to construction of a finite automata. It explains about the construction of a DFA with examples and a solution has been given to construct a DFA that accepts the set of all strings of 0's and 1's, such that each block of 5 digits has atleast 2 0's.