Better Automata through Process Algebra

18 Feb 2020 Cleaveland Rance

This paper shows how the use of Structural Operational Semantics (SOS) in the style popularized by the process-algebra community can lead to a more succinct and useful construction for building finite automata from regular expressions. Such constructions have been known for decades, and form the basis for the proofs of one direction of Kleene's Theorem... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • FORMAL LANGUAGES AND AUTOMATA THEORY