Decidability of regular language genus computation

DOI10.1017/S0960129519000057zbMath1434.68236arXiv1511.09405WikidataQ128052798 ScholiaQ128052798MaRDI QIDQ5108538

Florian Deloup, Guillaume Bonfante

Publication date: 4 May 2020

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.09405

zbMATH Keywords

planarityregular languagegraph embeddingdeterministic finite automatontopological genus

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inherently nonplanar automata
• The genus of regular languages

This page was built for publication: Decidability of regular language genus computation