An internal presentation of regular graphs by prefix-recognizable graphs

DOI10.1007/S00224-001-1015-5MaRDI QIDQ5949571zbMATH OpenOpenAlexFDO

Authors Teodor Knapik, Didier Caucal

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)

Recommendations

• Automata-based Representations for Infinite Graphs
• Prefix-Recognizable Graphs and Monadic Logic
• Finite Automata and the Analysis of Infinite Transition Systems
• scientific article; zbMATH DE number 1222592
• scientific article; zbMATH DE number 2102748

Cited in

(6)

• Infinite hypergraphs. II: Systems of recursive equations
• On the transition graphs of Turing machines.
• Infinite hypergraphs. I: Basic properties
• scientific article; zbMATH DE number 2038741 (Why is no real title available?)
• Prefix graphs and their applications
• Linearly bounded infinite graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5949571)