相关论文: Finite-State Non-Concatenative Morphotactics

Topology optimization enables the design of highly efficient and complex structures, but conventional iterative methods, such as SIMP-based approaches, often suffer from high computational costs and sensitivity to initial conditions.…

Tokenization is the first step in modern neural language model pipelines where an input text is converted to a sequence of subword tokens. We introduce from first principles a finite-state transduction framework which can efficiently encode…

We discuss the data-pattern tomography for reconstruction of entangled states of light. We show that for a moderate number of probe coherent states it is possible to achieve high accuracy of representation not only for single-mode states…

In this article, it is experimentally verified that nonreciprocal photonic systems with a continuous translation symmetry may have an ill-defined topology. The topological classification of such systems is only feasible when the material…

Standard Transformers excel at semantic modeling but struggle with rigid sequential logic and state tracking. Theoretical work establishes that self-attention is limited to $\AC^0$ (under hard attention) or $\TC^0$ (under soft attention),…

Conventional topological superconductors are fully gapped in the bulk but host gapless Majorana modes on their boundaries. We instead focus on a new class of superconductors, second-order topological superconductors, that have gapped,…

In Part I, a novel Galerkin-type method for finite dimensional approximations of transfer functions in Hardy space was developed based on approximation by simple poles. In Part II, this approximation is applied to system level synthesis, a…

Computational efficiency has remained a critical consideration in scaling high-capacity language models, with inference latency and resource consumption presenting significant constraints on real-time applications. The study has introduced…

We study the entanglement structure and the topological edge states of the ground state of the spin-1/2 XXZ model with bond alternation. We employ parity-density matrix renormalization group with periodic boundary conditions. The…

We consider imperfect two-mode bosonic quantum transducers that cannot completely transfer an initial source-system quantum state due to insufficient coupling strength or other non-idealities. We show that such transducers can generically…

Automaton models are often seen as interpretable models. Interpretability itself is not well defined: it remains unclear what interpretability means without first explicitly specifying objectives or desired attributes. In this paper, we…

We consider the previously defined notion of finite-state independence and we focus specifically on normal words. We characterize finite-state independence of normal words in three different ways, using three different kinds of asynchronous…

Transformer is eminently suitable for auto-regressive image synthesis which predicts discrete value from the past values recursively to make up full image. Especially, combined with vector quantised latent representation, the…

We introduce a framework for automatic differentiation with weighted finite-state transducers (WFSTs) allowing them to be used dynamically at training time. Through the separation of graphs from operations on graphs, this framework enables…

Over the last years, state-tracking tasks, particularly permutation composition, have become a testbed to understand the limits of sequence models architectures like Transformers and RNNs (linear and non-linear). However, these are often…

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…

Finite State Machine is a popular modeling notation for various systems, especially software and electronic. Test paths can be automatically generated from the system model to test such systems using a suitable algorithm. This paper…

Several abstract machines that operate on symbolic input alphabets have been proposed in the last decade, for example, symbolic automata or lattice automata. Applications of these types of automata include software security analysis and…

Finite state machines are widely used as a sound mathematical formalism that appropriately describes large scale, distributed and complex systems. Multiple interactions of finite state machines in complex systems are well captured by the…

In this paper we develop a new technique, called \textit{state redistribution}, that allows the use of explicit time stepping when approximating solutions to hyperbolic conservation laws on embedded boundary grids. State redistribution is a…