@InProceedings{durandgasselin_et_al:LIPIcs.STACS.2012.242,
author = {Durand-Gasselin, Antoine and Habermehl, Peter},
title = {{Ehrenfeucht-Fra\"{i}ss\'{e} goes elementarily automatic for structures of bounded degree}},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
pages = {242--253},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-35-4},
ISSN = {1868-8969},
year = {2012},
volume = {14},
editor = {D\"{u}rr, Christoph and Wilke, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.242},
URN = {urn:nbn:de:0030-drops-34198},
doi = {10.4230/LIPIcs.STACS.2012.242},
annote = {Keywords: Automata-based decision procedures for logical theories, Automatic Structures, Ehrenfeucht-Fra\"{i}ss\'{e} Games, Logics, Complexity}
}