A Simplified Solution To Design DFA That Accept Strings Over input symbol { a, b} Having At Least x Number Of A And Exactly x Number Of B.

Danish Ather,Ashendra Saxena, Ambuj Kr Agarwal

Abstract

Today, it is very difficult to understand the designing concepts of deterministic machine. One question is arise? How it is possible to understand the concepts of deterministic machine in a very easy manner. In this paper, we have design a DFA and develop an algorithm with suit-able graphs and examples that how DFA machine works in a simply manner. For it, we consider that a DFA machine takes the input string {a, b} having atleast x number of a and y number of b. The objective of this paper to understand the concepts of deterministic machine in easy manner. We have design a finite automata machine and developed an algorithm to accepts strings of input {a, b} having atleast x number of a and y number of b.



Full Text Pdf