Automatic structures of bounded degree

MaRDI QIDQ3408149zbMATH OpenFDO

Authors Markus Lohrey

Publication date 24 February 2010

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Computable structure theory, computable model theory (03C57)

Recommendations

• Automatic Structures of Bounded Degree Revisited
• Automatic structures of bounded degree revisited
• Model-theoretic complexity of automatic structures
• Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree
• Theories of Automatic Structures and Their Complexity

Cited in

(11)

• Preservation and decomposition theorems for bounded degree structures
• On the complexity of decision using destinies in \(H\)-bounded structures
• Boundedness of Monadic FO over Acyclic Structures
• Automatic structures: twenty years later
• EQUIVALENT AUTOMATIC STRUCTURES AND THEIR BOUNDARIES
• Analysing Complexity in Classes of Unary Automatic Structures
• Theories of Automatic Structures and Their Complexity
• Automatic structures of bounded degree revisited
• Automatic Structures of Bounded Degree Revisited
• Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree
• Foundations of Software Science and Computation Structures

This page was built for publication: Automatic structures of bounded degree

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