An internal presentation of regular graphs by prefix-recognizable graphs

DOI10.1007/S00224-001-1015-5zbMath0992.68157OpenAlexW1965235173MaRDI QIDQ5949571

Didier Caucal, Teodor Knapik

Publication date: 21 November 2001

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-001-1015-5

zbMATH Keywords

infinite graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Linearly bounded infinite graphs ⋮ On the transition graphs of Turing machines. ⋮ Infinite hypergraphs. II: Systems of recursive equations ⋮ Infinite hypergraphs. I: Basic properties

This page was built for publication: An internal presentation of regular graphs by prefix-recognizable graphs