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.

Authors

  • PROF.NILIMA SHINGATE Department of Computer Science Head of Department Christ College, Pune
  • MR.PRADIP SHINGATE Senior Software Developer WHIZ Technology, Pune

Keywords:

DFA, Transition Table, Transition Table (TT)

Abstract

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.

Downloads

Published

2021-02-20

Issue

2018: ICACTM

Section

Articles

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

How to Cite

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. (2021). JournalNX - A Multidisciplinary Peer Reviewed Journal, 168-170. https://repo.journalnx.com/index.php/nx/article/view/2058