A New Notion of Regularity: Finite State Automata Accepting Graphs

TL;DR

This paper introduces a new, weaker subclass of deterministic DAG languages that can be recognized by a classical DFA, enabling the transfer of string language techniques to graph languages.

Contribution

It defines a novel subclass of DAG languages for which a DFA can be constructed, refining the hierarchy of regular DAG languages and facilitating algorithmic applications.

Findings

A new subclass of DAG languages is identified.

DFA construction is possible for this subclass.

The class is closed under union and intersection.

Abstract

Analogous to regular string and tree languages, regular languages of directed acyclic graphs (DAGs) are defined in the literature. Although called regular, those DAG-languages are more powerful and, consequently, standard problems have a higher complexity than in the string case. Top-down as well as bottom-up deterministic DAG languages are subclasses of the regular DAG languages. We refine this hierarchy by providing a weaker subclass of the deterministic DAG languages. For a DAG grammar generating a language in this new DAG language class, or, equivalently, a DAG-automaton recognizing it, a classical deterministic finite state automaton (DFA) can be constructed. As the main result, we provide a characterization of this class. The motivation behind this is the transfer of techniques for regular string languages to graphs. Trivially, our restricted DAG language class is closed under union and intersection. This permits the application of minimization and hyper-minimization algorithms known for DFAs. This alternative notion of regularity coins at the existence of a DFA for recognizing a DAG language.