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; M Kamaraj

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

Issue

Vol 3 No 1 (2015)

Section

Article

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