An Efficient Algorithm to Design DFA That Accept Strings Over Input Symbol a, b Having Atmost x Num-ber of a & y Number of b.

DANISH ATHER

Abstract


Theory of computation is always been an issue for the students to understand. So there is a research gap which will ease the process of teaching learning. Our research objective is to develop method to make teaching learning process of theory of computation easier, simpler and understandable. In this paper we develop an algorithm which will generalize the design of finite automata that Accept Strings Over Input Symbol a, b Having Atmost x Number of a & y Number of b.


Keywords


DFA, Transition Table,FA, ATMOST

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

JNICĀ©: World Science Publisher United States