A proof procedure for testing membership in regular expression

• Autores: Keechang Kwon, Jiseung Kim
• Localización: International journal of the computer, the internet and management, ISSN 0858-7027, Vol. 18, Nº. 1 (ENE-ABR), 2010, págs. 47-50
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • We propose an algorithm that tests 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.