An Efficient Algorithm to Design DFA that Accept Strings Over the Input Symbol A, B, C having Atmost X Number of A, Y Number of B & Z Number of C

  • S Shanmugavadivoo Faculty in Mathematics, Madurai Kamaraj University College, Aundipatti, Theni
  • M Kamaraj Associate Professor of Mathematics, Government Arts & Science College, Sivakasi
Keywords: DFA, Automata, strings, Implementation, symbol

Abstract

Automata theory has played an important role in modeling behavior of systems In this paper we propose an algorithm to construct a DFA that accept strings over input symbols a, b, c having accept strings over input symbols a, b, c having atmost x number of a, y number of b & z number of c.

Published
2015-07-27
Statistics
Abstract views: 352 times
PDF downloads: 0 times
Section
Article