Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable

Martin Huschenbett. Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable. In S. Barry Cooper, Anuj Dawar, Benedikt Löwe, editors, How the World Computes - Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings. Volume 7318 of Lecture Notes in Computer Science, pages 313-322, Springer, 2012. [doi]

Abstract

Abstract is missing.