English
Related papers

Related papers: Normal basises and symbolical dynamics

200 papers

In terms of two-spinors a chiral formulation of general relativity with the Ashtekar Lagrangian and its Hamiltonian formalism in which the basic dynamic variables are the dyad spinors are presented. The extended Witten identities are…

General Relativity and Quantum Cosmology · Physics 2007-07-14 G. Y. Chee , Jingfei Zhang , Yongxin Guo

In computational argumentation, gradual semantics are fine-grained alternatives to extension-based and labelling-based semantics . They ascribe a dialectical strength to (components of) arguments sanctioning their degree of acceptability.…

Artificial Intelligence · Computer Science 2025-08-04 Anna Rapberger , Fabrizio Russo , Antonio Rago , Francesca Toni

A systematic procedure is proposed for deriving all the gauge symmetries of the general, not necessarily variational, equations of motion. For the variational equations, this procedure reduces to the Dirac-Bergmann algorithm for the…

Mathematical Physics · Physics 2015-05-13 S. L. Lyakhovich , A. A. Sharapov

Large Language Models are built on the so-called distributional semantic approach to linguistic meaning that has the distributional hypothesis at its core. The distributional hypothesis involves a holistic conception of word meaning: the…

Computation and Language · Computer Science 2025-04-04 Jumbly Grindrod , J. D. Porter , Nat Hansen

A fundamental theme in automata theory is regular languages of words and trees, and their many equivalent definitions. Salvati has proposed a generalization to regular languages of simply typed $\lambda$-terms, defined using denotational…

Logic in Computer Science · Computer Science 2024-02-09 Vincent Moreau , Lê Thành Dũng Nguyên

A theory of systems with long-range correlations based on the consideration of binary N-step Markov chains is developed. In the model, the conditional probability that the i-th symbol in the chain equals zero (or unity) is a linear function…

Data Analysis, Statistics and Probability · Physics 2016-09-08 O. V. Usatenko , V. A. Yampol'skii , K. E. Kechedzhy , S. S. Mel'nyk

In this note we present a characterisation of all unary and binary patterns that do not only contain variables, but also reversals of their instances. These types of variables were studied recently in either more general or particular…

Formal Languages and Automata Theory · Computer Science 2015-08-20 Robert Mercaş

Up to equivalence, a substitution in propositional logic is an endomorphism of its free algebra. On the dual space, this results in a continuous function, and whenever the space carries a natural measure one may ask about the stochastic…

Logic · Mathematics 2007-05-23 Giovanni Panti

A process algebra is proposed, whose semantics maps a term to a nondeterministic finite automaton (NFA, for short). We prove a representability theorem: for each NFA $N$, there exists a process algebraic term $p$ such that its semantics is…

Formal Languages and Automata Theory · Computer Science 2024-02-02 Roberto Gorrieri

Networks are a widely used and efficient paradigm to model real-world systems where basic units interact pairwise. Many body interactions are often at play, and cannot be modelled by resorting to binary exchanges. In this work, we consider…

Adaptation and Self-Organizing Systems · Physics 2020-06-03 Timoteo Carletti , Duccio Fanelli , Sara Nicoletti

We study a class of evolutionary partial differential systems with two components related to second order (in time) non-evolutionary equations of odd order in spatial variable. We develop the formal diagonalisation method in symbolic…

Exactly Solvable and Integrable Systems · Physics 2007-05-23 Vladimir S. Novikov , Jing Ping Wang

Fiore and Hur recently introduced a conservative extension of universal algebra and equational logic from first to second order. Second-order universal algebra and second-order equational logic respectively provide a model theory and a…

Logic in Computer Science · Computer Science 2013-08-27 Marcelo Fiore , Ola Mahmoud

Given an $\omega$-automaton and a set of substitutions, we look at which accepted words can also be defined through these substitutions, and in particular if there is at least one. We introduce a method using desubstitution of…

Formal Languages and Automata Theory · Computer Science 2023-04-12 Pierre Béaur , Benjamin Hellouin de Menibus

Modelling is an essential procedure in analyzing and controlling a given logical dynamic system (LDS). It has been proved that deterministic LDS can be modeled as a linear-like system using algebraic state space representation. However, due…

Optimization and Control · Mathematics 2022-03-04 Changxi Li , Jun-e Feng , Daizhan Cheng , Xiao Zhang

Let $\mb w$ be a morphic word over a finite alphabet $\Sigma$, and let $\Delta$ be a nonempty subset of $\Sigma$. We study the behavior of maximal blocks consisting only of letters from $\Delta$ in $\mb w$, and prove the following: let…

Combinatorics · Mathematics 2009-04-16 Yann Bugeaud , Dalia Krieger , Jeffrey Shallit

This paper discusses proof-theoretic semantics, the project of specifying the meanings of the logical constants in terms of rules of inference governing them. I concentrate on Michael Dummett's and Dag Prawitz' philosophical motivations and…

Logic in Computer Science · Computer Science 2021-08-12 Nils Kürbis

We extend the theory of Cellular Automata to arbitrary, time-varying graphs. In other words we formalize, and prove theorems about, the intuitive idea of a labelled graph which evolves in time - but under the natural constraint that…

Discrete Mathematics · Computer Science 2012-05-09 Pablo Arrighi , Gilles Dowek

Recently, a model of opinion formation with kinetic exchanges has been proposed in which a spontaneous symmetry breaking transition was reported [M. Lallouache et al, Phys. Rev. E, {\bf 82} 056112 (2010)]. We generalise the model to…

Physics and Society · Physics 2013-05-29 Parongama Sen

We begin with a new analysis of formal words. Let w be a formal word in letters g_1,...,g_k. The word map associated with w maps the permutations s_1,...,s_k in S_n to the permutation obtained by replacing for each i, every occurrence of…

Combinatorics · Mathematics 2011-04-21 Nati Linial , Doron Puder

Deformational structures, in many aspects generalizing standard elasticity theory, are investigated in abstract form. Within free deformational structures we define algebra of deformations, classify them by its special properties, define…

Mathematical Physics · Physics 2008-10-30 Sergey S. Kokarev