English
Related papers

Related papers: Kleene Algebras and Semimodules for Energy Problem…

200 papers

Weighted automata are non-deterministic automata where the transitions are equipped with weights. They can model quantitative aspects of systems like costs or energy consumption. The value of a run can be computed, for example, as the…

Logic in Computer Science · Computer Science 2015-06-22 Manfred Droste , Vitaly Perevoshchikov

We present a response-augmented machine learning (ML) approach to the energetics of electrified metal surfaces. We leverage local descriptors to learn the work function as the first-order energy change to introduced bias charges and…

Materials Science · Physics 2025-05-27 Nicolas Bergmann , Nicéphore Bonnet , Nicola Marzari , Karsten Reuter , Nicolas G. Hörmann

The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene on events in nerve nets and finite automata from 1956. In the present paper we tour a fragment of the literature and summarize results on…

Formal Languages and Automata Theory · Computer Science 2014-05-23 Hermann Gruber , Markus Holzer

Multi-head finite automata were introduced in (Rabin, 1964) and (Rosenberg, 1966). Since that time, a vast literature on computational and descriptional complexity issues on multi-head finite automata documenting the importance of these…

Computational Complexity · Computer Science 2009-06-19 Markus Holzer , Martin Kutrib , Andreas Malcher

We study constraint satisfaction problems on the so-called 'planted' random ensemble. We show that for a certain class of problems, e.g. graph coloring, many of the properties of the usual random ensemble are quantitatively identical in the…

Statistical Mechanics · Physics 2009-06-13 Florent Krzakala , Lenka Zdeborová

A multidimensional extremal problem in the idempotent algebra setting is considered which consists in minimizing a nonlinear functional defined on a finite-dimensional semimodule over an idempotent semifield. The problem integrates two…

Optimization and Control · Mathematics 2012-10-25 Nikolai Krivulin

In this paper, we define a new kind of weighted tree automata where the weights are only supported by final states. We show that these automata are sequentializable and we study their closures under classical regular and algebraic…

Formal Languages and Automata Theory · Computer Science 2015-01-19 Ludovic Mignot , Nadia Ouali-Sebti , Djelloul Ziadi

Energy system optimization models (ESOMs) should be used in an interactive way to uncover knife-edge solutions, explore alternative system configurations, and suggest different ways to achieve policy objectives under conditions of deep…

Physics and Society · Physics 2019-12-10 Joseph F. DeCarolis , Samaneh Babaee , Binghui Li , Suyash Kanungo

Multiple pendulums are investigated numerically and analytically to clarify the nonuniformity of average kinetic energies of particles. The nonuniformity is attributed to the system having constraints and it is consistent with the…

Chaotic Dynamics · Physics 2023-07-19 Tetsuro Konishi , Tatsuo Yanagita

This work is devoted to infinite-energy solutions of semi-linear wave equations in unbounded smooth domains of $\mathbb{R}^3$ with fractional damping of the form $(-\Delta_x+1)^\frac{1}{2}\partial_t u$. The work extends previously known…

Analysis of PDEs · Mathematics 2015-11-17 Anton Savostianov

Subzero automata is a class of tree automata whose acceptance condition can express probabilistic constraints. Our main result is that the problem of determining if a subzero automaton accepts some regular tree is decidable.

Formal Languages and Automata Theory · Computer Science 2016-08-12 Henryk Michalewski , Matteo Mio , Mikołaj Bojańczyk

Energy-based finite-element formulations provide a unified framework for describing complex physical systems in computational mechanics. In these energy-based methods, the governing equations can be obtained directly by considering the…

Numerical Analysis · Mathematics 2026-02-16 Mohit Pundir , Flavio Lorez , David S. Kammer

In quasi-exactly solvable problems partial analytic solution (energy spectrum and associated wavefunctions) are obtained if some potential parameters are assigned specific values. We introduce a new class in which exact solutions are…

Quantum Physics · Physics 2007-06-13 A. D. Alhaidari

Automata models for data languages (i.e. languages over infinite alphabets) often feature either global or local freshness operators. We show that Bollig et al.'s session automata, which focus on global freshness, are equivalent to regular…

Formal Languages and Automata Theory · Computer Science 2021-01-22 Lutz Schröder , Dexter Kozen , Stefan Milius , Thorsten Wißmann

We present a unified treatment of exact solutions for a class of four quantum mechanical models, namely the singular anharmonic potential, the generalized quantum isotonic oscillator, the soft-core Coulomb potential, and the…

Mathematical Physics · Physics 2015-06-03 Davids Agboola , Yao-Zhong Zhang

The total energy and electron addition and removal spectra can in principle be obtained exactly from the one-body Green's function. In practice, the Green's function is obtained from an approximate self-energy. In the framework of many-body…

Strongly Correlated Electrons · Physics 2023-12-08 Abdallah El-Sahili , Francesco Sottile , Lucia Reining

It is demonstrated that quasi-exactly solvable models of quantum mechanics admit an interesting duality transformation which changes the form of their potentials and inverts the sign of all the exactly calculable energy levels. This…

High Energy Physics - Theory · Physics 2007-05-23 A. Krajewska , A. Ushveridze , Z. Walczak

It is well understood that various alternatives are available within EM theory for the definitions of energy density, momentum transfer, EM stress-energy tensor, and so forth. Although the various options are all compatible with the basic…

General Physics · Physics 2010-09-28 H. E. Puthoff

We consider a simple nonlinear (quartic in the fields) gauge-invariant modification of classical electrodynamics, which possesses a regularizing ability sufficient to make the field energy of a point charge finite. The model is exactly…

High Energy Physics - Theory · Physics 2013-12-03 Caio V. Costa , Dmitri M. Gitman , Anatoly E. Shabad

This paper shows how the use of Structural Operational Semantics (SOS) in the style popularized by the process-algebra community can lead to a more succinct and useful construction for building finite automata from regular expressions. Such…

Formal Languages and Automata Theory · Computer Science 2020-02-19 Rance Cleaveland