A proof Procedure for Testing Membership in Regular Expressions

Details A proof Procedure for Testing Membership in Regular Expressions A proof Procedure for Testing Membership in Regular Expressions

2010-02-10

arxiv.org/abs/1002.2203v1

International Journal of Computer Science and Information Security, IJCSIS, Vol. 7, No. 1, pp. 225-227, January 2010, USA

Computer Science

Formal Languages and Automata Theory

IEEE format, International Journal of Computer Science and Information Security, IJCSIS January 2010, ISSN 1947 5500, http:/

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A proof Procedure for Testing Membership in Regular Expressions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A proof Procedure for Testing Membership in Regular Expressions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A proof Procedure for Testing Membership in Regular Expressions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-67544