A Structural Construction of a Deterministic Position Automaton
O. V.ShanmugaSundaram, Narmadha Murugesan · International Journal of Computer Applications · 2013
Every regular expression can be transformed into a Nondeterministic Finite Automaton (NFA) with or without - transitions.A well known algorithm called subset construction technique is used for conversion of NFA into DFA.In this paper, initially, the construction of the position automaton is given for the same.Also, the algorithm to convert this Position Automaton into DFA using subset construction technique is discussed.