A proof Procedure for Testing Membership in Regular Expressions

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.

[1]  Dale Miller,et al.  Logic programming in a fragment of intuitionistic linear logic , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[2]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[3]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[4]  Paul Caspi,et al.  A Kleene theorem for timed automata , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[5]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .