On Constructing Finite Automata by Relational Programming

TL;DR

This paper introduces a relational programming approach to construct minimal finite automata for specific input-output pairs, aiming to facilitate analysis of game-playing programs in a mathematical framework.

Contribution

It presents a novel method using relational programming to build minimal transducers tailored for particular input-output datasets, diverging from traditional automata optimization techniques.

Findings

Successfully constructs minimal transducers from input-output pairs

Provides a new approach for automata in game analysis

Enhances algebraic analysis capabilities for automata

Abstract

We consider ways to construct a transducer for a given set of input word to output symbol pairs. This is motivated by the need for representing game playing programs in a low-level mathematical format that can be analyzed by algebraic tools. This is different from the classical applications of finite state automata, thus the usual optimization techniques are not directly applicable. Therefore, we use relational programming tools to find minimal transducers realizing a given set of input-output pairs.