On a code problem concerning planar acyclic graphs

DOI10.1051/ITA/1991250302051zbMath0727.68053OpenAlexW178971872MaRDI QIDQ3350765

Bruno Warin, Francis Bossut

Publication date: 1991

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92389

zbMATH Keywords

unsolvabilitycode problemconnected planardirected ordered acyclic graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Parallel and two-way automata on directed ordered acyclic graphs
• Transformational classes of grammars
• The parsing for general phrase-structure grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a code problem concerning planar acyclic graphs