Results 1 to 10 of about 39,046 (115)
Complete formal systems for equivalence problems
Theoretical Computer Science, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Geraud Senizergues
exaly +3 more sources
Formal Verification of Flow Equivalence in Desynchronized Designs [PDF]
2020 26th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC), 2020 To appear in ASYNC ...
Peter Beerel
exaly +3 more sources
Formal Game Grammar and Equivalence [PDF]
2020 IEEE Conference on Games (CoG), 2020 We develop methods to formally describe and compare games, in order to probe questions of game structure and design, and as a stepping stone to predicting player behavior from design patterns. We define a grammar-like formalism to describe finite discrete games without hidden information, allowing for randomness, and mixed sequential and simultaneous ...
Paul Riggins, David McPherson
openaire +2 more sources
On the semantic equivalence of language syntax formalisms [PDF]
Theoretical Computer Science, 2020 There are various approaches to describing the syntax of a language [\textit{E. Visser}, Syntax definition for language prototyping. Amsterdam: Univ. Amsterdam (1997; Zbl 0900.68290)]. Formal grammar [\textit{N. Chomsky}, Three models for the description of language. IRE Trans. Inf. Theory 2, No. 3, 113-124 (1956; Zbl 0156.25401)], [\textit{J. Earley},
Samuele Buro, Isabella Mastroeni
openaire +4 more sources
Morita Equivalence of Formal Poisson Structures [PDF]
International Mathematics Research Notices, 2021 Abstract We extend the notion of Morita equivalence of Poisson manifolds to the setting of formal Poisson structures, that is, formal power series of bivector fields $\pi =\pi _0 + \lambda \pi _1 +\cdots $ satisfying the Poisson integrability condition $[\pi ,\pi ]=0$.
Bursztyn, Henrique +2 more
openaire +2 more sources
On the Commutative Equivalence of Algebraic Formal Series and Languages [PDF]
International Journal of Foundations of Computer Science, 2021 The problem of the commutative equivalence of context-free and regular languages is studied. Conditions ensuring that a context-free language of exponential growth is commutatively equivalent with a regular language are investigated.
Carpi A., D'Alessandro F.
openaire +4 more sources
*-IDEALS AND FORMAL MORITA EQUIVALENCE OF *-ALGEBRAS [PDF]
International Journal of Mathematics, 2001 Motivated by deformation quantization, we introduced in an earlier work the notion of formal Morita equivalence in the category of *-algebras over a ring [Formula: see text] which is the quadratic extension by i of an ordered ring [Formula: see text]. The goal of the present paper is twofold.
Bursztyn, Henrique, Waldmann, Stefan
openaire +3 more sources
General formalism of the quantum equivalence principle
Communications Physics, 2023 AbstractA consistent theory of quantum gravity will require a fully quantum formulation of the classical equivalence principle. Such a formulation has been recently proposed in terms of the equality of the rest, inertial and gravitational mass operators, and for non-relativistic particles in a weak gravitational field.
Saurya Das +2 more
openaire +4 more sources
Affordance Equivalences in Robotics: A Formalism
Frontiers in Neurorobotics, 2018 Automatic knowledge grounding is still an open problem in cognitive robotics. Recent research in developmental robotics suggests that a robot's interaction with its environment is a valuable source for collecting such knowledge about the effects of robot's actions.
Mihai Andries +4 more
openaire +5 more sources
A simple formalization of alpha-equivalence
CoRRWhile teaching untyped $λ$-calculus to undergraduate students, we were wondering why $α$-equivalence is not directly inductively defined. In this paper, we demonstrate that this is indeed feasible. Specifically, we provide a grounded, inductive definition for $α$-equivalence and show that it conforms to the specification provided in the literature. The
Kalmer Apinis, Danel Ahman
openaire +2 more sources