TITLE: Graph and language/automaton equivalence
QUESTION [0 upvotes]: I'm looking for a reference rather than an answer. I think I'm just not Googling the right combination of terms. I imagine that there is a class of graphs which is equivalent to some class of languages via some transformation (acceptance?). I'd like to know more about this, but can't seem to find much.

REPLY [1 votes]: I guess you mean regular languages accepted by finite automata. Just Google one of these words:  finite automaton, DFA, NFA, regular language or look at this question
How to convert finite automata to regular expressions?
Edit. To answer your last remark, you might be interested in this paper, which heavily relies on Stone duality.
{"set_name": "stack_exchange", "score": 0, "question_id": 1266274}