Related papers: Aperiodic two-way transducers and FO-transductions
We study the expressive power and succinctness of order-invariant sentences of first-order (FO) and monadic second-order (MSO) logic on structures of bounded tree-depth. Order- invariance is undecidable in general and, thus, one strives for…
A product of irreducible representations of magnetic translation group is considered. It leads to irreducible representations which were previously rejected as nonphysical. A very simple example indicates a possible application of these…
We investigate the scaling properties of implicit deductive reasoning over Horn clauses in depth-bounded Transformers. By systematically decorrelating provability from spurious features and enforcing algorithmic alignment, we find that in…
It is well known that attributed tree transducers can be equipped with "regular look-around" in order to obtain a more robust class of translations. We present two characterizations of this class in terms of macro tree transducers (MTTs):…
It is proved that the fixed point submonoid and the periodic point submonoid of a trace monoid endomorphism are always finitely generated. Considering the Foata normal form metric on trace monoids and uniformly continuous endomorphisms, a…
Inspired by a width invariant defined on permutations by Guillemot and Marx [SODA '14], we introduce the notion of twin-width on graphs and on matrices. Proper minor-closed classes, bounded rank-width graphs, map graphs, $K_t$-free unit…
We put forward several general conjectures concerning the algebraicity or transcendence of continued fractions and Stieltjes continued fractions defined by the Thue-Morse and period-doubling sequences in characteristic $2$. We present our…
In this note we give a simple unifying proof of the undecidability of several diagrammatic properties of term rewriting systems that include: local confluence, strong confluence, diamond property, subcommutative property, and the existence…
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data omega-words). The notion of computability is defined through Turing machines with infinite inputs which can…
In the previous author's paper the Macdonald norm conjecture (including the famous constant term conjecture) was proved. This paper contains the proof of the remaining two (the duality and evaluation conjectures). The evaluation theorem is…
We study the positive logic FO+ on finite words, and its fragments, pursuing and refining the work initiated in [Kuperberg 2023]. First, we transpose notorious logic equivalences into positive first-order logic: FO+ is equivalent to LTL+ ,…
We consider the class of languages defined in the 2-variable fragment of the first-order logic of the linear order. Many interesting characterizations of this class are known, as well as the fact that restricting the number of quantifier…
We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…
This paper presents a complete axiomatization of Monadic Second-Order Logic (MSO) over infinite trees. MSO on infinite trees is a rich system, and its decidability ("Rabin's Tree Theorem") is one of the most powerful known results…
For operators belonging either to a class of global bisingular pseudodifferential operators on $R^m \times R^n$ or to a class of bisingular pseudodifferential operators on a product $M \times N$ of two closed smooth manifolds, we show the…
Several insertion operations are studied applied to languages accepted by one-way and two-way deterministic reversal-bounded multicounter machines. These operations are defined by the ideals obtained from relations such as the prefix,…
Linear extended top-down tree transducers (or synchronous tree-substitution grammars) are popular formal models of tree transformations. The expressive power of compositions of such transducers with and without regular look-ahead is…
Periodically driven coherent conductors provide a universal platform for the development of quantum transport devices. Here, we lay down a comprehensive theory to describe the thermodynamics of these systems. We first focus on moderate…
Bloch theorem for a periodic operator is being revisited here, and we notice extra orthogonality relationships. It is shown that solutions are bi-periodic, in the sense that eigenfunctions are periodic with respect to one argument, and…
Since the 1970s with the work of McNaughton, Papert and Sch\"utzenberger, a regular language is known to be definable in the first-order logic if and only if its syntactic monoid is aperiodic. This algebraic characterisation of a…