Graph representation functions computable by finite automata

DOI10.25596/JALC-2008-073MaRDI QIDQ5503441zbMATH OpenFDO

Authors Vadim Lozin

Publication date 15 January 2009

Full work available at URL https://doi.org/10.25596/JALC-2008-073

zbMATH Keywords

graph codingvertex representation

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Automata-based Representations for Infinite Graphs
• A functional approach to the representation of graphs
• Finite languages for the representation of finite graphs
• Real functions computable by finite automata using affine representations.
• scientific article; zbMATH DE number 7604432

Cited in

(6)

• Graphs are not universal for online computability
• Function simulation, graph grammars and colourings
• Automata-based Representations for Infinite Graphs
• Mathematical Foundations of Computer Science 2004
• Graph automata: Natural expression of self-reproduction
• On languages describing large graph classes

This page was built for publication: Graph representation functions computable by finite automata

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