Related papers: Word series for dynamical systems and their numeri…
This article surveys the burgeoning area at the intersection of dynamical systems theory and algorithms for NP-hard problems. Traditionally, computational complexity and the analysis of non-deterministic polynomial-time (NP)-hard problems…
Extended regular expressions with counting and interleaving are widely used in practice. However the related theoretical studies for this kind of expressions currently cannot meet the need of practical work. This paper develops syntax…
Regular nested word languages (a.k.a. visibly pushdown languages) strictly extend regular word languages, while preserving their main closure and decidability properties. Previous works have shown that considering languages of 2-nested…
Probabilistic programming is becoming increasingly popular thanks to its ability to specify problems with a certain degree of uncertainty. In this work, we focus on term rewriting, a well-known computational formalism. In particular, we…
We study cooperating distributed grammar systems working in hybrid modes in connection with the finite index restriction in two different ways: firstly, we investigate cooperating distributed grammar systems working in hybrid modes which…
Under quite general conditions critical phenomena can be described with high order linked cluster expansions. The coefficients of the series admit a graphical expansion that is generated with the aid of computers. Our generalization of…
The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case…
We show that, for appropriate combinations of the values of the delay and the forcing frequency, it is possible to obtain easily high-order averaged versions of periodically forced systems of delay differential equations with constant…
Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…
In the former article "Formal mathematical systems including a structural induction principle" we have presented a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the…
This paper presents a novel approach to automatically solving arithmetic word problems. This is the first algorithmic approach that can handle arithmetic problems with multiple steps and operations, without depending on additional…
In this master's thesis, we introduce expansion systems as a general framework to describe a large variety of approximation algorithms, such as Taylor approximation, decimal expansion and continued fraction. We consider some basic…
A deformation of the standard prolongation operation, defined on sets of vector fields in involution rather than on single ones, was recently introduced and christened "\sigma-prolongation"; correspondingly one has "\sigma-symmetries" of…
We introduce a new class of extensions of terms that consists in navigation strategies and insertion of contexts. We introduce an operation of combination on this class which is associative, admits a neutral element and so that each…
An algebraic formalism for the study of interacting particle systems is developed. Particle processes are described in terms of the category theory. The problem for the unique description of these processes is discussed. Categories relevant…
Given the first 20-100 coefficients of a typical generating function of the type that arises in many problems of statistical mechanics or enumerative combinatorics, we show that the method of differential approximants performs surprisingly…
Formal language techniques have been used in the past to study autonomous dynamical systems. However, for controlled systems, new features are needed to distinguish between information generated by the system and input control. We show how…
We describe and experimentally evaluate a method for automatically clustering words according to their distribution in particular syntactic contexts. Deterministic annealing is used to find lowest distortion sets of clusters. As the…
In the talk at the workshop my aim was to demonstrate the usefulness of graph techniques for tackling problems that have been studied predominantly as problems on the term level: increasing sharing in functional programs, and addressing…
With the increased interest in machine learning, and deep learning in particular, the use of automatic differentiation has become more wide-spread in computation. There have been two recent developments to provide the theoretical support…