Decision Procedures for MSO on Words Based on Derivatives of Regular Expressions

Dmitriy Traytel 🌐 and Tobias Nipkow 🌐

June 12, 2014

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

Monadic second-order logic on finite words (MSO) is a decidable yet expressive logic into which many decision problems can be encoded. Since MSO formulas correspond to regular languages, equivalence of MSO formulas can be reduced to the equivalence of some regular structures (e.g. automata). We verify an executable decision procedure for MSO formulas that is not based on automata but on regular expressions.

Decision procedures for regular expression equivalence have been formalized before, usually based on Brzozowski derivatives. Yet, for a straightforward embedding of MSO formulas into regular expressions an extension of regular expressions with a projection operation is required. We prove total correctness and completeness of an equivalence checker for regular expressions extended in that way. We also define a language-preserving translation of formulas into regular expressions with respect to two different semantics of MSO.

License

BSD License

Topics

Related publications

  • TRAYTEL, D., & NIPKOW, T. (2015). Verified decision procedures for MSO on words based on derivatives of regular expressions. Journal of Functional Programming, 25. https://doi.org/10.1017/s0956796815000246
  • author's copy

Session MSO_Regex_Equivalence

Depends on

Cite

× 
@article{MSO_Regex_Equivalence-AFP,
  author  = {Dmitriy Traytel and Tobias Nipkow},
  title   = {Decision Procedures for MSO on Words Based on Derivatives of Regular Expressions},
  journal = {Archive of Formal Proofs},
  month   = {June},
  year    = {2014},
  note    = {\url{https://isa-afp.org/entries/MSO_Regex_Equivalence.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: