GENERAL APPROACH TO DFA CONSTRUCTION

Author’s Name : N Murugesan |O V Shanmuga Sundaram

Volume 02 Issue 04  Year 2015  ISSN No:  2349-3828  Page no: 12-17

Abstract – In this paper, various types of automata and its accepted languages are illustrated.  The exact language of binary strings of multiples of three representing the DFA is constructed. Based on proposed approach, a systematic way to design a DFA is provided from constructed NFA’s.

Keywords –Regular expressions, binary strings, and construction of NFA and DFA