English
Related papers

Related papers: Finite-State Non-Concatenative Morphotactics

200 papers

A weighted finite-state machine with n tapes (n-WFSM) defines a rational relation on n strings. It is a generalization of weighted acceptors (one tape) and transducers (two tapes). After recalling some basic definitions about n-ary weighted…

Formal Languages and Automata Theory · Computer Science 2011-05-02 André Kempe

We propose a two-scale finite element method designed for heterogeneous microstructures. Our approach exploits domain diffeomorphisms between the microscopic structures to gain computational efficiency. By using a conveniently constructed…

Numerical Analysis · Mathematics 2024-10-24 Omar Richardson , Omar Lakkis , Adrian Muntean , Chandrasekhar Venkataraman

Two-mode charge (pair) coherent states has been introduced previously by using $<\eta|$ representation. In the present paper we reobtain these states by a rather different method. Then, using the nonlinear coherent states approach and based…

Quantum Physics · Physics 2015-06-04 M Mortazavi , M K Tavassoly

We present a method to synthesize an arbitrary quantum state of two superconducting resonators. This state-synthesis algorithm utilizes a coherent interaction of each resonator with a tunable artificial atom to create entangled quantum…

Quantum Physics · Physics 2013-05-29 Frederick W. Strauch , Kurt Jacobs , Raymond W. Simmonds

Using a regularization by putting the system in finite volume, we develop a novel approach to form factor perturbation theory for nonintegrable models described as perturbations of integrable ones. This permits to go beyond first order in…

High Energy Physics - Theory · Physics 2009-11-09 G. Takacs

Traditionally, character-level transduction problems have been solved with finite-state models designed to encode structural and linguistic knowledge of the underlying process, whereas recent approaches rely on the power and flexibility of…

Computation and Language · Computer Science 2021-06-25 Maria Ryskina , Eduard Hovy , Taylor Berg-Kirkpatrick , Matthew R. Gormley

This paper constructs a finite state abstraction of a possibly continuous-time and infinite state model in two steps. First, a finite external signal space is added, generating a so called $\Phi$-dynamical system. Secondly, the strongest…

Systems and Control · Computer Science 2014-03-17 Anne-Kathrin Schmuck , Jörg Raisch

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…

Computation and Language · Computer Science 2022-12-06 David Waterworth , Subbu Sethuvenkatraman , Quan Z. Sheng

This paper extends the calculus of regular expressions with new types of replacement expressions that enhance the expressiveness of the simple replace operator defined in Karttunen (1995). Parallel replacement allows multiple replacements…

cmp-lg · Computer Science 2008-02-03 Andre Kempe , Lauri Karttunen

Interactive theorem provers have been used extensively to reason about various software/hardware systems and mathematical theorems. The key challenge when using an interactive prover is finding a suitable sequence of proof steps that will…

Logic in Computer Science · Computer Science 2014-05-15 Thomas Gransden , Neil Walkinshaw , Rajeev Raman

We present a methodology for designing metagratings for perfect anomalous refraction, based on multilayered loaded wire arrays. In recent work, it has been shown that such structures can implement perfect anomalous deflection and beam…

Applied Physics · Physics 2018-04-09 Ariel Epstein , Oshri Rabinovich

We study the robust output regulation of linear boundary control systems by constructing extended systems. The extended systems are established based on solving static differential equations under two new conditions. We first consider the…

Optimization and Control · Mathematics 2021-04-19 Duy Phan , Lassi Paunonen

We present a theoretical analysis of methods to synthesize entangled states of two superconducting resonators. These methods use experimentally demonstrated interactions of resonators with artificial atoms, and offer efficient routes to…

Quantum Physics · Physics 2013-05-30 Frederick W. Strauch , Douglas Onyango , Kurt Jacobs , Raymond W. Simmonds

This paper addresses the following verification task: Given a graph transformation system and a class of initial graphs, can we guarantee (non-)reachability of a given other class of graphs that characterizes bad or erroneous states? Both…

Logic in Computer Science · Computer Science 2025-04-14 Barbara König , Arend Rensink , Lara Stoltenow , Fabian Urrigshardt

This paper proposes an extension of the finite cell method (FCM) to V-rep models, a novel geometric framework for volumetric representations. This combination of an embedded domain approach (FCM) and a new modeling framework (V-rep) forms…

Computational Engineering, Finance, and Science · Computer Science 2020-12-04 Benjamin Wassermann , Nina Korshunova , Stefan Kollmannsberger , Ernst Rank , Gershon Elber

The existence of quantum non-liquid states and fracton orders, both gapped and gapless states, challenges our understanding of phases of entangled matter. We generalize the cellular topological states to liquid or non-liquid cellular…

Strongly Correlated Electrons · Physics 2022-07-01 Juven Wang

Finite-state abstractions (a.k.a. symbolic models) present a promising avenue for the formal verification and synthesis of controllers in continuous-space control systems. These abstractions provide simplified models that capture the…

Systems and Control · Electrical Eng. & Systems 2025-02-25 Daniel Ajeleye , Majid Zamani

In the article the problem of output setpoint tracking for affine non-linear system is considered. Presented approach combines state feedback linearization and homotopy numerical continuation in subspaces of phase space where feedback…

Systems and Control · Computer Science 2012-07-02 Alex Borisevich , Gernot Schullerus

A study of assisted problem solving formalized via decompositions of deterministic finite automata is initiated. The landscape of new types of decompositions of finite automata this study uncovered is presented. Languages with various…

Computational Complexity · Computer Science 2007-07-04 Peter Gaži , Branislav Rovan

While persistent homology has taken strides towards becoming a wide-spread tool for data analysis, multidimensional persistence has proven more difficult to apply. One reason is the serious drawback of no longer having a concise and…

Algebraic Topology · Mathematics 2018-12-20 Mickaël Buchet , Emerson G. Escolar
‹ Prev 1 3 4 5 6 7 10 Next ›