Automatic structures of bounded degree revisited

Authors:
Dietrich Kuske;Markus Lohrey
Affiliations:
Universität Leipzig, Institut für Informatik, Germany;Universität Leipzig, Institut für Informatik, Germany
Venue:
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Year:
2009

Citing 4
Cited 1

On the valuedness of finite transducers

Acta Informatica
Automatic Presentations of Structures

LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Automatic Structures

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Upper bounds for a theory of queues

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Ehrenfeucht--Fraïssé goes automatic for real addition

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automatic presentations, this holds even uniformly). Presenting an automatic structure of bounded degree whose theory is hard for 2EXPSPACE, we also prove this result to be optimal. These findings close the gap left open in [14].