DSpace
 

DSpace at IIT Bombay >
IITB Publications >
Article >

Please use this identifier to cite or link to this item: http://dspace.library.iitb.ac.in/jspui/handle/10054/7993

Title: Proof of correctness of a direct construction of DFA from regular expression
Authors: BABU, SR
SANYAL, A
VENKATESH, G
Issue Date: 1997
Publisher: GORDON BREACH SCI PUBL LTD
Citation: INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 64(3-4), 191-210
Abstract: We present a proof of correctness of an algorithm for directly constructing a deterministic finite automaton (DFA) from a regular expression. We do this in a functional framework by introducing a structure called dot annotated regular expression (dare). A dare acts as an implicit representation of a state in a DFA. State transitions in a DFA correspond to dot movements in a dare. We investigate and identify certain algebraic properties of dare's which are then used to prove the correctness of the algorithm. The proof is algebraic and presented in the same framework as that of the algorithm itself.
URI: http://dx.doi.org/10.1080/00207169708804584
http://dspace.library.iitb.ac.in/xmlui/handle/10054/7993
http://hdl.handle.net/10054/7993
ISSN: 0020-7160
Appears in Collections:Article

Files in This Item:

There are no files associated with this item.

View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback