A proof Procedure for Testing Membership in Regular Expressions
Formal Languages and Automata Theory
2010-02-11 v1
Abstract
We propose an algorithm that test membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The advantage of this algorithm over traditional ones is that the complex conversion process from regular expressions to finite automata is not needed. As a consequence, our algorithm is simple and extends easily to various extensions to regular expressions such as timed regular expressions or regular languages with the intersection.
Cite
@article{arxiv.1002.2203,
title = {A proof Procedure for Testing Membership in Regular Expressions},
author = {Keehang Kwon and Hong Pyo Ha and Jiseung Kim},
journal= {arXiv preprint arXiv:1002.2203},
year = {2010}
}
Comments
IEEE format, International Journal of Computer Science and Information Security, IJCSIS January 2010, ISSN 1947 5500, http://sites.google.com/site/ijcsis/