Design of Minimal States Deterministic Finite Pattern Using the Concept of Regular Expression
Syed Asif Ali
Associate Prof. Syed Asif Ali, Department of Computer Science, SMI University, Karachi, Pakistan.
Manuscript received on 21 March 2013 | Revised Manuscript received on 28 March 2013 | Manuscript published on 30 March 2013 | PP: 99-101 | Volume-2 Issue-1, March 2013 | Retrieval Number: A0468032113/2013©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: 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.
Keywords: Sign Language pattern, Deterministic Finite Automata (DFA), Minimization of DFA.
Scope of the Article: Natural Language Processing