Abstract. We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions of word equations with length constraints. The atomic formulas over this language are equality over string terms (word equations), linear inequality over the length function (length constraints), and membership in regular sets. These questions are important in logic, program analysis, and formal verification. Variants of these questions have been studied for many decades and practical satisfiability procedures (aka SMT solvers) for these formulas have become increasingly important in the analysis of string-manipulating programs such as web applications and scripts. We prove three main theorems. First, we give a new proof of undecidability for the validity problem for the set of sentences written as a ∀∃ quantifier alternation applied to positive word equations. A corollary of this undecidability result is that this set is undecidable even with sentences with at most two occurrences of a string variable. Second, we consider Boolean combinations of quantifier-free formulas constructed out of word equations and length constraints. We show that if word equations can be converted to a solved form, a form relevant in practice, then the satisfiability problem for Boolean combinations of word equations and length constraints is decidable. Third, we show that the satisfiability problem for quantifier-free formulas over word equations in regular solved form, length constraints, and the membership predicate over regular expressions is also decidable.
a b s t r a c tWe study the complexity of automatic structures via well-established concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks of structures, and Cantor-Bendixson ranks (of trees). We prove the following results: (1) The ordinal height of any automatic well-founded partial order is bounded by ω ω . (2) The ordinal heights of automatic well-founded relations are unbounded below ω CK 1 , the first non-computable ordinal. (3) For any computable ordinal α, there is an automatic structure of Scott rank at least α. Moreover, there are automatic structures of Scott rank ω CK 1 , ω CK 1 +1. (4) For any computable ordinal α, there is an automatic successor tree of Cantor-Bendixson rank α.
PrefaceThis paper grew out of three tutorial lectures on automatic structures given at the Logic Colloquium 2007 in Wroc law (Poland). The paper will follow the outline of the tutorial lectures, supplementing some material along the way. We discuss variants of automatic structures related to several models of computation: word automata, tree automata, Büchi automata, and Rabin automata. Word automata process finite strings, tree automata process finite labeled trees, Büchi automata process infinite strings, and Rabin automata process infinite binary labeled trees. Finite automata are the most commonly known in the general computer science community. Such an automaton reads finite input strings from left to right, making state transitions along the way. Depending on its last state after processing a given string, the automaton either accepts or rejects the input string. Automatic structures are mathematical objects which can be represented by (word, tree, Büchi, or Rabin) automata. The study of properties of automatic structures is a relatively new and very active area of research.We begin with some motivation and history for studying automatic structures. We introduce definitions of automatic structures, present examples, and discuss decidability and definability theorems. Next, we concentrate on finding natural isomorphism invariants for classes of automatic structures. These classes include well-founded partial orders, Boolean algebras, linear orders, trees, and finitely generated groups. Finally, we address the issue of complexity for automatic structures. In order to measure complexity of automatic structures we involve topology (via the Borel hierarchy), model theory (Scott ranks), computability theory (Σ 1 1 -completeness), and computational complexity (the class P).This paper consists of three sections based on the tutorial lectures. The first lecture provides motivating questions and historical context, formal definitions of the different types of automata involved, examples of automatic structures, and decidability and definability results about automatic structures. The second lecture considers tree and Rabin automatic structures, and outlines techniques for proving non-automaticity. We then turn our attention to the study of algorithmic and structural properties of automatic trees, Boolean algebras, and finitely generated groups. The final lecture presents a framework for reducing certain questions about computable structures to questions about automatic structures. These reductions have been used to show that, in some cases, the sharp bound on complexity of automatic structures is as high as the bounds for computable structures. We conclude by looking at Borel structures from descriptive set theory and connecting them to Büchi and Rabin automatic structures.1 Basics Motivating questionsThe study of structures has played a central role in the development of logic.In the course of this study, several themes have been pursued. We will see how questions related to each of these themes is addressed in the ...
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.