scientific article
From MaRDI portal
Publication:2904765
DOI10.4230/LIPIcs.STACS.2012.242zbMath1245.03061MaRDI QIDQ2904765
Peter Habermehl, Antoine Durand-Gasselin
Publication date: 23 August 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityautomatic structuresEhrenfeucht-Fraïssé gamesautomata-based decision procedures for logical theories
Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Model theory of finite structures (03C13) Computable structure theory, computable model theory (03C57)
Related Items (3)
Isomorphisms of scattered automatic linear orders ⋮ Uniformly Automatic Classes of Finite Structures ⋮ The isomorphism problem on classes of automatic structures with transitive relations
This page was built for publication:
