agda-regexp-automata icon indicating copy to clipboard operation
agda-regexp-automata copied to clipboard

Published 20 hours ago • verified publisher icon desi-ivanov
→

Metadata

Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma.

Formalization of Regular Languages in Agda

We use the proof assistant Agda to prove properties on Regular Expressions and Finite State Automata:

  • Regular Expressions and algebraic laws
  • The matching problem solved using Brozozowski's Derivatives
  • Deterministic and non-deterministic finite state automata
  • The matching problem solved using finite state automata
  • Pumping lemma for regular languages

A final report is available here

← Metadata

15
Stars
0
Forks
Watchers

Owner

verified publisher icon desi-ivanov

Metadata

Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma.

Back