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

Any two-way finite state automaton is equivalent to some one-way finite state automaton. This well-known result, shown by Rabin and Scott and independently by Shepherdson, states that two-way finite state automata (even non-deterministic)…

Token prediction stability remains a challenge in autoregressive generative models, where minor variations in early inference steps often lead to significant semantic drift over extended sequences. A structured modulation mechanism was…

The transformation of a nondeterministic finite-state automaton into a deterministic finite-state automaton is an integral part of any course on formal languages and automata theory. For some students, understanding this transformation is…

In this paper we reformulate Abelian and non-Abelian noninvariant systems as gauge invariant theories using a new constraint conversion scheme, developed on the symplectic framework. This conversion method is not plagued by the ambiguity…

A syntactic model is presented for the specification of finite-state synchronous digital logic systems with complex input/output interfaces, which control the flow of data between opaque computational elements, and for the composition of…

We propose a second order finite volume scheme for nonlinear degenerate parabolic equations. For some of these models (porous media equation, drift-diffusion system for semiconductors, ...) it has been proved that the transient solution…

Topologies of large deformation Contact-aided Compliant Mechanisms (CCMs), with self and mutual contact, exemplified via path generation applications, are designed using the continuum synthesis approach. Design domains are parameterized…

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…

Topological phases of matter give rise to exotic physics that can be leveraged for next generation quantum computation and spintronic devices. Thus, the search for topological phases and the quantum states that they exhibit have become the…

The set of two-body reduced states of translation invariant, infinite quantum spin chains can be approximated from inside and outside using matrix product states and marginals of finite systems, respectively. These lead to hierarchies of…

The static linearity performance metrics of the GFET transconductor are studied and modeled. Closed expressions are proposed for second and third order harmonic distortion (HD2, HD3), second and third order intermodulation distortion…

We present a method to construct number-conserving Hamiltonians whose ground states exactly reproduce an arbitrarily chosen BCS-type mean-field state. Such parent Hamiltonians can be constructed not only for the usual $s$-wave BCS state,…

Finite-state automata are a very effective tool in natural language processing. However, in a variety of applications and especially in speech precessing, it is necessary to consider more general machines in which arcs are assigned weights…

A design methodology and synthesis equations are described for lumped-element filter prototypes having low-pass, high-pass, band-pass, or band-stop characteristics with theoretically perfect input- and output-match at all frequencies. Such…

Owing to the presence of exceptional points (EPs), non-Hermitian (NH) systems can display intriguing topological phenomena without Hermitian analogs. However, experimental characterizations of exceptional topological invariants have been…

We introduce a novel model-theoretic framework inspired from graph modification and based on the interplay between model theory and algorithmic graph minors. The core of our framework is a new compound logic operating with two types of…

A method is given that "inverts" a logic grammar and displays it from the point of view of the logical form, rather than from that of the word string. LR-compiling techniques are used to allow a recursive-descent generation algorithm to…

This article considers application of genetic algorithms for finite machine synthesis. The resulting genetic finite state machines synthesis algorithm allows for creation of machines with less number of states and within shorter time. This…

We extend the concept of strange correlators, defined for symmetry-protected phases in [You et al., Phys. Rev. Lett. 112, 247202 (2014)], to topological phases of matter by taking the inner product between string-net ground states and…

Scenarios, or Message Sequence Charts, offer an intuitive way of describing the desired behaviors of a distributed protocol. In this paper we propose a new way of specifying finite-state protocols using scenarios: we show that it is…