Automata on Graph Alphabets

TL;DR

This paper introduces automata theory for languages over structured graph alphabets, establishing foundational theorems, algorithms, and highlighting differences from classical automata theory.

Contribution

It develops an automata framework for graph-structured alphabets, including Kleene and Myhill-Nerode theorems, and algorithms for determinization and minimization.

Findings

Kleene theorem for graph alphabets

Automata can be determinized and minimized

Regular languages are not closed under complementation

Abstract

The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We introduce automata over a particular type of structured data, namely an alphabet which is given as a (finite or infinite) directed graph. This constrains concatenation: two strings may only be concatenated if the end vertex of the first is equal to the start vertex of the second. We develop the beginnings of an automata theory for languages on graph alphabets. We show that they admit a Kleene theorem, relating rational and regular languages, and a Myhill-Nerode theorem, stating that languages are regular iff they have finite prefix or, equivalently, suffix quotient. We present determinization and minimization algorithms, but we also exhibit that regular languages are not stable by complementation. Finally, we mention how these structures could be generalized to presimplicial alphabets, where languages are no more freely generated.