We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive $\omega$-words with decidable monadic second order theories is $\Sigma_3$-complete. (b) Known characterisations of the $\omega$-words with decidable monadic second order theories are transfered to the corresponding question for bi-infinite words. (c) We show that such "tame" predicates $P$ exist in every Turing degree. (d) We determine, for $P\subseteq\mathbb{Z}$, the number of predicates $Q\subseteq\mathbb{Z}$ such that $(\mathbb{Z},\le,P)$ and $(\mathbb{Z},\le,Q)$ are indistinguishable. Through these results we demonstrate similarities and differences between logical properties of infinite and bi-infinite words.

Source : oai:arXiv.org:1712.03759

DOI : 10.23638/LMCS-14(3:9)2018

Volume: Volume 14, Issue 3

Published on: August 21, 2018

Submitted on: December 12, 2017

Keywords: Computer Science - Logic in Computer Science,Computer Science - Formal Languages and Automata Theory

Version2

This page has been seen 83 times.

This article's PDF has been downloaded 29 times.