Computer Science > Formal Languages and Automata Theory
[Submitted on 13 Sep 2021 (v1), last revised 9 Apr 2024 (this version, v4)]
Title:The decidability of the genus of regular languages and directed emulators
View PDFAbstract:The article continues our study of the genus of a regular language $L$, defined as the minimal genus among all genera of all finite deterministic automata recognizing $L$. Here we define and study two closely related tools on a directed graph: directed emulators and automatic relations. A directed emulator morphism essentially encapsulates at the graph-theoretic level an epimorphism onto the minimal deterministic automaton. An automatic relation is the graph-theoretic version of the Myhill-Nerode relation. We show that an automatic relation determines a directed emulator morphism and respectively, a directed emulator morphism determines an automatic relation up to isomorphism. Consider the set $S$ of all directed emulators of the underlying directed graph of the minimal deterministic automaton for $L$. We prove that the genus of $L$ is $\underset{G \in S}{\min}\ g(G)$. We also consider the more restrictive notion of directed cover and prove that the genus of $L$ is reached in the class of directed covers of the underlying directed graph of the minimal deterministic automaton for $L$. This stands in sharp contrast to undirected emulators and undirected covers which we also consider. Finally we prove that if the problem of determining the minimal genus of a directed emulator of a directed graph has a solution then the problem of determining the minimal genus of an undirected emulator of an undirected graph has a solution.
Submission history
From: Florian Deloup L [view email][v1] Mon, 13 Sep 2021 06:46:18 UTC (39 KB)
[v2] Wed, 24 Nov 2021 08:47:40 UTC (39 KB)
[v3] Sat, 27 Aug 2022 18:08:54 UTC (47 KB)
[v4] Tue, 9 Apr 2024 15:38:30 UTC (48 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
Connected Papers (What is Connected Papers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.