Regular-expression derivatives re-examined

DOI10.1017/S0956796808007090zbMath1163.68317MaRDI QIDQ3616446

Aaron Joseph Turon, Scott Owens, John Reppy

Publication date: 25 March 2009

Published in: Journal of Functional Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items (17)

Derived-Term Automata for Extended Weighted Rational Expressions ⋮ Proof Pearl: regular expression equivalence and relation algebra ⋮ Derivatives and partial derivatives for regular shuffle expressions ⋮ Unnamed Item ⋮ Verified decision procedures for MSO on words based on derivatives of regular expressions ⋮ Partial Derivatives for Context-Free Languages ⋮ Calculational design of a regular model checker by abstract interpretation ⋮ Incomplete operational transition complexity of regular languages ⋮ Bidirectional grammars for machine-code decoding and encoding ⋮ Derivatives for Regular Shuffle Expressions ⋮ A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions (Proof Pearl) ⋮ Derived-Term Automata of Multitape Rational Expressions ⋮ Derivatives for Enhanced Regular Expressions ⋮ A Decision Procedure for Regular Expression Equivalence in Type Theory ⋮ Proof-directed program transformation: A functional account of efficient regular expression matching ⋮ A formalisation of the Myhill-Nerode theorem based on regular expressions ⋮ Efficient enumeration of regular expressions for faster regular expression synthesis

Uses Software

• DrScheme

Cites Work

• From regular expressions to deterministic automata
• DrScheme: a programming environment for Scheme
• Programming Techniques: Regular expression search algorithm
• Derivatives of Regular Expressions
• Unnamed Item
• Unnamed Item

This page was built for publication: Regular-expression derivatives re-examined