FINITE AUTOMATA VALIDATION WITH VARIABLES IN FUNCTIONAL PROGRAMMING LANGUAGES
Read the full article ';
This article describes a domain-specific language (eDSL) for automata-based programming embedded into the Haskell programming language. Proposed eDSL supports extensive code reuse and validation of state-transition functions. This is achieved through developed representation of logical formula that is free from both fixed set of input variables and fixed set of predicates. This allows combination of states in automata even if they were designed for different sets of input variables.
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License