Simplified Solution to Design Dfa, That Accept Strings Over {A,b} Having at Least X Number of ‘a' or Y Number of ‘B' Common Between Two Condition.
Nilima Shingate, Pradip Shingate · JournalNX · 2018
Today, it is very difficult to understand the de- signing 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 method with suit- able 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 at least x number of a or y number of b common between TWO condition. The objective of this paper to under- stand the concepts of deterministic machine in easy manner.