Automata-based presentations of infinite structures

MaRDI QIDQ3172381zbMATH OpenFDO

Authors Vince Bárány, Erich Grädel, Sasha Rubin

Publication date 5 October 2011

zbMATH Keywords

automatamodel checkingmonadic second-order logic

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Algebraic theory of languages and automata (68Q70)

Recommendations

• Finite presentations of infinite structures: Automata and interpretations
• scientific article; zbMATH DE number 5872401
• Finite Automata and the Analysis of Infinite Transition Systems
• Automata Presenting Structures: A Survey of the Finite String Case
• Automata-based Representations for Infinite Graphs

Cited in

(14)

• Model checking CTL over restricted classes of automatic structures
• Finite presentations of infinite structures: Automata and interpretations
• Second-order finite automata
• The isomorphism problem for tree-automatic ordinals with addition
• On decidability of list structures
• Isomorphisms of scattered automatic linear orders
• Survey on formal models to reason about infinite data values
• Automata Presenting Structures: A Survey of the Finite String Case
• Automata-based Representations for Infinite Graphs
• scientific article; zbMATH DE number 2087217 (Why is no real title available?)
• Climbing up the elementary complexity classes with theories of automatic structures
• Tree-automatic well-founded trees
• A class of rational trace relations closed under composition
• Word structures and their automatic presentations

This page was built for publication: Automata-based presentations of infinite structures

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