Regular Sets and Expressions

MaRDI QIDQ7361044FDO

Authors Alexander Krauss, Tobias Nipkow, Manuel Eberl, Christian Urban

Publication date 12 May 2010

Cites work

• Derivatives of Regular Expressions
• Unnamed Publication
• Partial derivatives of regular expressions and finite automaton constructions
• Proof Pearl: regular expression equivalence and relation algebra

Cited in

(15)

• Formalization of Knuth–Bendix Orders for Lambda-Free Higher-Order Terms
• Unified Decision Procedures for Regular Expression Equivalence
• The Myhill-Nerode Theorem Based on Regular Expressions
• POSIX Lexing with Derivatives of Regular Expressions
• Isabelle/DOF
• A Codatatype of Formal Languages
• Abstract Rewriting
• First Order Clause
• Executable Transitive Closures
• Light-weight Containers
• Parikh's Theorem
• Analysis of List Update Algorithms
• Finite Automata in Hereditarily Finite Set Theory
• Functional Automata
• The number of comparisons in QuickSort

This page was built for software: Regular Sets and Expressions