Design of Minimal States Deterministic Finite Pattern Using the Concept of Regular Expression

the purpose of this paper is to design a minimal states deterministic finite automaton for Sign language pattern using the concept regular expression. Deterministic finite automata are a practical approach used for designing a computational model. This paper also emphasis on minimization of Sign language DFA using the concept of contraction (or merging) of equivalent states algorithm.