25,772 research outputs found
Automatic structures of bounded degree revisited
The first-order theory of a string automatic structure is known to be
decidable, but there are examples of string automatic structures with
nonelementary first-order theories. We prove that the first-order theory of a
string automatic structure of bounded degree is decidable in doubly exponential
space (for injective automatic presentations, this holds even uniformly). This
result is shown to be optimal since we also present a string automatic
structure of bounded degree whose first-order theory is hard for 2EXPSPACE. We
prove similar results also for tree automatic structures. These findings close
the gaps left open in a previous paper of the second author by improving both,
the lower and the upper bounds.Comment: 26 page
An optimal construction of Hanf sentences
We give the first elementary construction of equivalent formulas in Hanf
normal form. The triply exponential upper bound is complemented by a matching
lower bound
Observation and Distinction. Representing Information in Infinite Games
We compare two approaches for modelling imperfect information in infinite games by using finite-state automata. The first, more standard approach views information as the result of an observation process driven by a sequential Mealy machine. In contrast, the second approach features indistinguishability relations described by synchronous two-tape automata.
The indistinguishability-relation model turns out to be strictly more expressive than the one based on observations. We present a characterisation of the indistinguishability relations that admit a representation as a finite-state observation function. We show that the characterisation is decidable, and give a procedure to construct a corresponding Mealy machine whenever one exists
Simulation of Two-Way Pushdown Automata Revisited
The linear-time simulation of 2-way deterministic pushdown automata (2DPDA)
by the Cook and Jones constructions is revisited. Following the semantics-based
approach by Jones, an interpreter is given which, when extended with
random-access memory, performs a linear-time simulation of 2DPDA. The recursive
interpreter works without the dump list of the original constructions, which
makes Cook's insight into linear-time simulation of exponential-time automata
more intuitive and the complexity argument clearer. The simulation is then
extended to 2-way nondeterministic pushdown automata (2NPDA) to provide for a
cubic-time recognition of context-free languages. The time required to run the
final construction depends on the degree of nondeterminism. The key mechanism
that enables the polynomial-time simulations is the sharing of computations by
memoization.Comment: In Proceedings Festschrift for Dave Schmidt, arXiv:1309.455
12th International Workshop on Termination (WST 2012) : WST 2012, February 19â23, 2012, Obergurgl, Austria / ed. by Georg Moser
This volume contains the proceedings of the 12th International Workshop on Termination (WST 2012), to be held February 19â23, 2012 in Obergurgl, Austria. The goal of the Workshop on Termination is to be a venue for presentation and discussion of all topics in and around termination. In this way, the workshop tries to bridge the gaps between different communities interested and active in research in and around termination. The 12th International Workshop on Termination in Obergurgl continues the successful workshops held in St. Andrews (1993), La Bresse (1995), Ede (1997), Dagstuhl (1999), Utrecht (2001), Valencia (2003), Aachen (2004), Seattle (2006), Paris (2007), Leipzig (2009), and Edinburgh (2010). The 12th International Workshop on Termination did welcome contributions on all aspects of termination and complexity analysis. Contributions from the imperative, constraint, functional, and logic programming communities, and papers investigating applications of complexity or termination (for example in program transformation or theorem proving) were particularly welcome. We did receive 18 submissions which all were accepted. Each paper was assigned two reviewers. In addition to these 18 contributed talks, WST 2012, hosts three invited talks by Alexander Krauss, Martin Hofmann, and Fausto Spoto
A Survey on Multisensor Fusion and Consensus Filtering for Sensor Networks
Multisensor fusion and consensus filtering are two fascinating subjects in the research of sensor networks. In this survey, we will cover both classic results and recent advances developed in these two topics. First, we recall some important results in the development ofmultisensor fusion technology. Particularly, we pay great attention to the fusion with unknown correlations, which ubiquitously exist in most of distributed filtering problems. Next, we give a systematic review on several widely used consensus filtering approaches. Furthermore, some latest progress on multisensor fusion and consensus filtering is also presented. Finally,
conclusions are drawn and several potential future research directions are outlined.the Royal Society of the UK, the National Natural Science Foundation of China under Grants 61329301, 61374039, 61304010, 11301118, and 61573246, the Hujiang Foundation of China under Grants C14002
and D15009, the Alexander von Humboldt Foundation of Germany, and the Innovation Fund Project for Graduate Student of Shanghai under Grant JWCXSL140
Continuity argument revisited: geometry of root clustering via symmetric products
We study the spaces of polynomials stratified into the sets of polynomial
with fixed number of roots inside certain semialgebraic region , on its
border, and at the complement to its closure. Presented approach is a
generalisation, unification and development of several classical approaches to
stability problems in control theory: root clustering (-stability) developed
by R.E. Kalman, B.R. Barmish, S. Gutman et al., -decomposition(Yu.I.
Neimark, B.T. Polyak, E.N. Gryazina) and universal parameter space method(A.
Fam, J. Meditch, J.Ackermann).
Our approach is based on the interpretation of correspondence between roots
and coefficients of a polynomial as a symmetric product morphism.
We describe the topology of strata up to homotopy equivalence and, for many
important cases, up to homeomorphism. Adjacencies between strata are also
described. Moreover, we provide an explanation for the special position of
classical stability problems: Hurwitz stability, Schur stability,
hyperbolicity.Comment: 45 pages, 4 figure
The First-Order Theory of Ground Tree Rewrite Graphs
We prove that the complexity of the uniform first-order theory of ground tree
rewrite graphs is in ATIME(2^{2^{poly(n)}},O(n)). Providing a matching lower
bound, we show that there is some fixed ground tree rewrite graph whose
first-order theory is hard for ATIME(2^{2^{poly(n)}},poly(n)) with respect to
logspace reductions. Finally, we prove that there exists a fixed ground tree
rewrite graph together with a single unary predicate in form of a regular tree
language such that the resulting structure has a non-elementary first-order
theory.Comment: accepted for Logical Methods in Computer Scienc
- âŠ