On equivalent representations of infinite structures

DOI10.1007/3-540-45061-0_48MaRDI QIDQ4449206zbMATH OpenFDO

Authors Arnaud Carayol, Thomas Colcombet

Publication date 8 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2719/27190599.htm

zbMATH Keywords

monadic second-order logic

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Automata-based Representations for Infinite Graphs
• scientific article; zbMATH DE number 2086614
• On infinite transition graphs having a decidable monadic theory
• An internal presentation of regular graphs by prefix-recognizable graphs
• Infinite hypergraphs. I: Basic properties

Cited in

(2)

• Various forms of infinity for finitely supported structures
• On finite representations of infinite sequences of terms

This page was built for publication: On equivalent representations of infinite structures

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