Related papers: Space-Efficient Bimachine Construction Based on th…
Solving the challenges of automatic machine translation of Building Automation System text metadata is a crucial first step in efficiently deploying smart building applications. The vocabulary used to describe building metadata appears…
We consider the structures given by repeatedly generalising the definition of finite state automata by symmetry considerations, and constructing analogues of transition monoids at each step. This approach first gives us non-deterministic…
Molecular machines composed of coupled subsystems transduce free energy between different external reservoirs, in the process internally transducing energy and information. While subsystem efficiencies of these molecular machines have been…
We prove that by successively combining subassemblies, we can achieve sublinear construction times for "staged" assembly of micro-scale objects from a large number of tiny particles, for vast classes of shapes; this is a significant advance…
Machines enabled the Industrial Revolution and are central to modern technological progress: A machine's parts transmit forces, motion, and energy to one another in a predetermined manner. Today's engineering frontier, building artificial…
Glushkov's construction has many interesting properties and they become even more evident when applied to transducers. This article strives to show the wast range of possible extensions and optimisations for this algorithm. Special flavour…
The class of regular transformations has several equivalent characterizations such as functional MSO transductions, deterministic two-way transducers, streaming string transducers, as well as regular transducer expressions (RTE). For…
In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-state automata from a set of strings. Traditional methods consist of two phases: the first to construct a trie, the second one to minimize it.…
This paper analyzes the mechanisms of the equivalent machine and also its advantages in TSA. Based on the two group separations, an equivalent machine is modeled through the equivalence of the motions of all machines inside each group. This…
The self-equalization property has raised great concern in the combination of offset-quadratic-amplitude-modulation-based filter bank multi-carrier (FBMC/OQAM) and massive multiple-input multiple-output (MIMO) system, which enables to…
We consider ways to construct a transducer for a given set of input word to output symbol pairs. This is motivated by the need for representing game playing programs in a low-level mathematical format that can be analyzed by algebraic…
The paper provides a method to approximate a large-scale finite-valued network by a smaller model called the aggregated simulation, which is a combination of aggregation and (bi-)simulation. First, the algebraic state space representation…
In balanced allocations, the goal is to place $m$ balls into $n$ bins, so as to minimize the gap (difference of max to average load). The One-Choice process places each ball to a bin sampled independently and uniformly at random. The…
We present three methods to construct majorizing measures in various settings. These methods are based on direct constructions of increasing sequences of partitions through a simple exhaustion procedure rather than on the construction of…
We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…
Using the techniques of optomechanics, a high-$Q$ mechanical oscillator may serve as a link between electromagnetic modes of vastly different frequencies. This approach has successfully been exploited for the frequency conversion of…
Transformer models have revolutionized AI tasks, but their large size hinders real-world deployment on resource-constrained and latency-critical edge devices. While binarized Transformers offer a promising solution by significantly reducing…
The synthesis of string transformation programs from input-output examples utilizes various techniques, all based on an inductive bias that comprises a restricted set of basic operators to be combined. A new algorithm, Transduce, is…
Constant bit-size Transformers are known to be Turing complete, but existing constructions require $\Omega(s(n))$ chain-of-thought (CoT) steps per simulated Turing machine (TM) step, leading to impractical reasoning lengths. In this paper,…
The transition structure of an automaton can be used to create a natural topology to the set of states of an automaton, generating, this way, a topological space. Probabilistic automata can also be modeled in terms of measure theory. A…