Results 11 to 20 of about 494,097 (364)
Decidability for Sturmian words [PDF]
Logical Methods in Computer Science, 2021 We show that the first-order theory of Sturmian words over Presburger arithmetic is decidable. Using a general adder recognizing addition in Ostrowski numeration systems by Baranwal, Schaeffer and Shallit, we prove that the first-order expansions of ...
Philipp Hieronymi +5 more
doaj +3 more sources
The logical strength of B\"uchi's decidability theorem [PDF]
Logical Methods in Computer Science, 2019 We study the strength of axioms needed to prove various results related to automata on infinite words and B\"uchi's theorem on the decidability of the MSO theory of $(N, {\le})$.
Leszek Kołodziejczyk +3 more
doaj +3 more sources
Decidability Problems for Actor Systems [PDF]
Logical Methods in Computer Science, 2014 We introduce a nominal actor-based language and study its expressive power. We have identified the presence/absence of fields as a crucial feature: the dynamic creation of names in combination with fields gives rise to Turing completeness.
Frank De Boer +3 more
doaj +3 more sources
Decidability via the tilting correspondence [PDF]
Algebra & Number Theory, 2020 We prove relative decidability results for perfectoid fields. This applies to show that the fields $\mathbb{Q}_p(p^{1/p^{\infty}})$ and $\mathbb{Q}_p(\zeta_{p^{\infty}})$ are (existentially) decidable relative to $ \mathbb{F}_p((t))^{1/p^{\infty}}$ and $\
Konstantinos Kartas
semanticscholar +1 more source
Kähler moduli stabilization and the propagation of decidability [PDF]
Physical Review D, 2019 Diophantine equations are in general undecidable, yet appear readily in string theory. We demonstrate that numerous classes of Diophantine equations arising in string theory are decidable and propose that decidability may propagate through networks of ...
James Halverson +3 more
semanticscholar +1 more source
E-unification by means of tree tuple synchronized grammars [PDF]
Discrete Mathematics & Theoretical Computer Science, 1997 The goal of this paper is both to give an E-unification procedure that always terminates, and to decide unifiability. For this, we assume that the equational theory is specified by a confluent and constructor-based rewrite system, and that four ...
Sébastien Limet, Pierre Réty
doaj +1 more source
On the decidability of reachability in linear time-invariant systems [PDF]
International Conference on Hybrid Systems: Computation and Control, 2018 We consider the decidability of state-to-state reachability in linear time-invariant control systems over discrete time. We analyse this problem with respect to the allowable control sets, which in general are assumed to be defined by boolean ...
Nathanaël Fijalkow +4 more
semanticscholar +1 more source
Decidability, complexity, and expressiveness of first-order logic over the subword ordering [PDF]
Logic in Computer Science, 2017 We consider first-order logic over the subword ordering on finite words where each word is available as a constant. Our first result is that the Σ1 theory is undecidable (already over two letters).
Simon Halfon +2 more
semanticscholar +1 more source
Decidability of Non-interactive Simulation of Joint Distributions [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2016 We present decidability results for a sub-class of "non-interactive" simulation problems, a well-studied class of problems in information theory. A non-interactive simulation problem is specified by two distributions P(x, y) and Q(u, v): The goal is to ...
Badih Ghazi, Pritish Kamath, M. Sudan
semanticscholar +1 more source
Improved Undecidability Results for Reachability Games on Recursive Timed Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We study reachability games on recursive timed automata (RTA) that generalize Alur-Dill timed automata with recursive procedure invocation mechanism similar to recursive state machines. It is known that deciding the winner in reachability games on RTA is
Shankara Narayanan Krishna +2 more
doaj +1 more source