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 Kumar Saxena
  • Ambuj Kumar Agarwal
Keywords: DFA, Transition Table, Transition Graph(TG), Input Symbol

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 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 under

stand the concepts of deterministic machine in easy man

ner. We have design a finite automata machine and devel

oped an algorithm to accepts strings of input {a, b} having

atleast x number of a and y number of b

Author Biographies

Danish Ather

Department Of Computer Applications, Teerthanker Mahaveer Univerisity, Moradabad, India.

Ashendra Kumar Saxena

Department Of Computer Applications, Teerthanker Mahaveer Univerisity, Moradabad, India

Ambuj Kumar Agarwal

Department Of Computer Applications, Teerthanker Mahaveer Univerisity, Moradabad, India

Published
2014-02-04
How to Cite
Ather, D., Saxena, A. K., & Agarwal, A. K. (2014). 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. MATRIX Academic International Online Journal Of Engineering And Technology, 2(2), 1-5. Retrieved from https://www.maiojet.com/index.php/matrix/article/view/16
Issue
Vol. 2 No. 2 (2014): Arp,2014 Edition Volume II Issue I
Section
Articles