The genus of regular languages

DOI10.1017/S0960129516000037zbMath1382.68132MaRDI QIDQ4599611

Florian Deloup, Guillaume Bonfante

Publication date: 4 January 2018

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Decidability of regular language genus computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Logical structures and genus of proofs
• Inherently nonplanar automata
• Linear Automaton Transformations
• A graph-theoretic via minimization algorithm for two-layer printed circuit boards