Climbing up the Elementary Complexity Classes with Theories of Automatic Structures
Abstract
This paper explores the complexity classes associated with theories of automatic structures, providing new insights into their elementary properties and computational boundaries.
Type
Publication
27th EACSL Annual Conference on Computer Science Logic (CSL 2018), Birmingham, UK