mathlib documentation

computability.regular_expressions

Regular Expressions #

This file contains the formal definition for regular expressions and basic lemmas. Note these are regular expressions in terms of formal language theory. Note this is different to regex's used in computer science such as the POSIX standard.

TODO

source
inductive regular_expression (α : Type u) :
Type u

This is the definition of regular expressions. The names used here is to mirror the definition of a Kleene algebra (https://en.wikipedia.org/wiki/Kleene_algebra).

  • 0 (zero) matches nothing
  • 1 (epsilon) matches only the empty string
  • char a matches only the string 'a'
  • star P matches any finite concatenation of strings which match P
  • P + Q (plus P Q) matches anything which match P or Q
  • P * Q (comp P Q) matches x ++ y if x matches P and y matches Q
source
@[instance]
def regular_expression.inhabited {α : Type u} :
inhabited (regular_expression α)
Equations
source
@[instance]
def regular_expression.has_add {α : Type u} :
has_add (regular_expression α)
Equations
source
@[instance]
def regular_expression.has_mul {α : Type u} :
has_mul (regular_expression α)
Equations
source
@[instance]
def regular_expression.has_one {α : Type u} :
has_one (regular_expression α)
Equations
source
@[instance]
def regular_expression.has_zero {α : Type u} :
has_zero (regular_expression α)
Equations
source
@[simp]
theorem regular_expression.zero_def {α : Type u} :
regular_expression.zero = 0
source
@[simp]
theorem regular_expression.one_def {α : Type u} :
regular_expression.epsilon = 1
source
@[simp]
theorem regular_expression.plus_def {α : Type u} (P Q : regular_expression α) :
P.plus Q = P + Q
source
@[simp]
theorem regular_expression.comp_def {α : Type u} (P Q : regular_expression α) :
P.comp Q = P * Q
source
def regular_expression.matches {α : Type u} :
regular_expression α → language α

matches P provides a language which contains all strings that P matches

Equations
source
@[simp]
theorem regular_expression.matches_zero_def {α : Type u} :
0.matches = 0
source
@[simp]
theorem regular_expression.matches_epsilon_def {α : Type u} :
1.matches = 1
source
@[simp]
theorem regular_expression.matches_add_def {α : Type u} (P Q : regular_expression α) :
(P + Q).matches = P.matches + Q.matches
source
@[simp]
theorem regular_expression.matches_mul_def {α : Type u} (P Q : regular_expression α) :
(P * Q).matches = (P.matches) * Q.matches
source
@[simp]
theorem regular_expression.matches_star_def {α : Type u} (P : regular_expression α) :
P.star.matches = P.matches.star
source
def regular_expression.match_epsilon {α : Type u} :
regular_expression α → bool

match_epsilon P is true if and only if P matches the empty string

Equations
source
def regular_expression.deriv {α : Type u} [dec : decidable_eq α] :
regular_expression α → α → regular_expression α

P.deriv a matches x if P matches a :: x, the Brzozowski derivative of P with respect to a

Equations
source
def regular_expression.rmatch {α : Type u} [dec : decidable_eq α] :
regular_expression α → list α → bool

P.rmatch x is true if and only if P matches x. This is a computable definition equivalent to matches.

Equations
source
@[simp]
theorem regular_expression.zero_rmatch {α : Type u} [dec : decidable_eq α] (x : list α) :
0.rmatch x = ff
source
theorem regular_expression.one_rmatch_iff {α : Type u} [dec : decidable_eq α] (x : list α) :
↥(1.rmatch x) ↔ x = list.nil
source
theorem regular_expression.char_rmatch_iff {α : Type u} [dec : decidable_eq α] (a : α) (x : list α) :
↥((regular_expression.char a).rmatch x) ↔ x = [a]
source
theorem regular_expression.add_rmatch_iff {α : Type u} [dec : decidable_eq α] (P Q : regular_expression α) (x : list α) :
↥((P + Q).rmatch x) ↔ ↥(P.rmatch x) ∨ ↥(Q.rmatch x)
source
theorem regular_expression.mul_rmatch_iff {α : Type u} [dec : decidable_eq α] (P Q : regular_expression α) (x : list α) :
↥((P * Q).rmatch x) ↔ ∃ (t u : list α), x = t ++ u ∧ ↥(P.rmatch t) ∧ ↥(Q.rmatch u)
source
theorem regular_expression.star_rmatch_iff {α : Type u} [dec : decidable_eq α] (P : regular_expression α) (x : list α) :
↥(P.star.rmatch x) ↔ ∃ (S : list (list α)), x = S.join ∧ ∀ (t : list α), t ∈ S → t ≠ list.nil ∧ ↥(P.rmatch t)
source
@[simp]
theorem regular_expression.rmatch_iff_matches {α : Type u} [dec : decidable_eq α] (P : regular_expression α) (x : list α) :
↥(P.rmatch x) ↔ x ∈ P.matches
source
@[instance]
def regular_expression.matches.decidable_pred {α : Type u} [dec : decidable_eq α] (P : regular_expression α) :
decidable_pred P.matches
Equations