Related papers: On repetitive right application of B-terms
The B-series composition theorem has been an important topic in numerical analysis of ordinary differential equations for the past-half century. Traditional proofs of this theorem rely on labelled trees, whereas recent developments in…
The paper presents several combinatorial properties of the boolean cumulants. A corollary is a new proof of the multiplicative property of the boolean cumulant series that can be easily adapted for the case of boolean independence with…
A new technique is presented to prove non-termination of term rewriting. The basic idea is to find a non-empty regular language of terms that is closed under rewriting and does not contain normal forms. It is automated by representing the…
The fundamental properties of biquaternions (complexified quaternions) are presented including several different representations, some of them new, and definitions of fundamental operations such as the scalar and vector parts, conjugates,…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
There exists a rich literature of rule formats guaranteeing different algebraic properties for formalisms with a Structural Operational Semantics. Moreover, there exist a few approaches for automatically deriving axiomatizations…
Various concepts of grammatical compositionality arise in many theories of both natural and artificial languages, and often play a key role in accounts of the syntax-semantics interface. We propose that many instances of compositionality…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
We present the formalization of a theory of syntax with bindings that has been developed and refined over the last decade to support several large formalization efforts. Terms are defined for an arbitrary number of constructors of varying…
In this paper, we introduce the notion of conditionally bi-free independence in an amalgamated setting. We define operator-valued conditionally bi-multiplicative pairs of functions and construct operator-valued conditionally bi-free moment…
We introduce bud generating systems, which are used for combinatorial generation. They specify sets of various kinds of combinatorial objects, called languages. They can emulate context-free grammars, regular tree grammars, and synchronous…
In this paper, we give a further study on $B$-tensors and introduce doubly $B$-tensors that contain $B$-tensors. We show that they have similar properties, including their decompositions and strong relationship with strictly (doubly)…
Language theory, symbolic dynamics, modelisation of viral insertion into the genetic code of a host cell motivate the introduction of new types of bialgebras whose coalgebra parts are not necessarily coassociative. One of the aim of this…
The study of rational relations is fundamental to the study of formal languages and automata theory. A rational relation is conjugate if each pair of words in the relation is conjugate (or cyclic shifts of each other). The notion of…
Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite linear orders) and…
The paper concerns fractal homeomorphism between the attractors of two bi-affine iterated function systems. After a general discussion of bi-affine functions, conditions are provided under which a bi-affine iterated function system is…
We study substitutive systems generated by nonprimitive substitutions and show that transitive subsystems of substitutive systems are substitutive. As an application we obtain a complete characterisation of the sets of words that can appear…
We study the properties of the sequence of words $(B_i)$, where $B_1 = 101$ and $B_{i+1} = B_i C_i$ for $i \geq 1$, where $C_i$ is $B_i$ with the first $i$ symbols removed, and the infinite binary sequence ${\bf b} = 10101101011011101…
In call-by-value languages, some mutually-recursive value definitions can be safely evaluated to build recursive functions or cyclic data structures, but some definitions (let rec x = x + 1) contain vicious circles and their evaluation…
The usual Laurent expansion of the analytic tensors on the complex plane is generalized to any closed and orientable Riemann surface represented as an affine algebraic curve. As an application, the operator formalism for the $b-c$ systems…