English
Related papers

Related papers: Algebraic Elimination of epsilon-transitions

200 papers

We introduce a novel technique to analyse unambiguous B\"uchi automata quantitatively, and apply this to the model checking problem. It is based on linear-algebra arguments that originate from the analysis of matrix semigroups with constant…

Formal Languages and Automata Theory · Computer Science 2024-09-17 Stefan Kiefer , Cas Widdershoven

We introduce a new morphism between algebraic and hermitian K-theory. The topological analog is the Adams operation in real K-theory. From this morphism, we deduce a lower bound for the higher algebraic K-theory of a ring A in terms of the…

K-Theory and Homology · Mathematics 2016-09-07 Max Karoubi

We introduce hypernode automata as a new specification formalism for hyperproperties of concurrent systems. They are finite automata with nodes labeled with hypernode logic formulas and transitions labeled with actions. A hypernode logic…

Formal Languages and Automata Theory · Computer Science 2024-01-09 Ezio Bartocci , Thomas A. Henzinger , Dejan Nickovic , Ana Oliveira da Costa

In this paper, the author aims to establish a mathematical model for a mimic computer. To this end, a novel automaton is proposed. First, a one-dimensional cellular automaton is used for expressing some dynamic changes in the structure of a…

Formal Languages and Automata Theory · Computer Science 2017-03-07 Weijun Zhu

Following up on a paper of Balamohan, Kuznetsov, and Tanny, we analyze a variant of Hofstadter's Q-sequence and show it is 2-automatic. An automaton computing the sequence is explicitly given.

Number Theory · Mathematics 2011-06-14 J. -P. Allouche , J. Shallit

A kind of motivic algebra of spectral categories and modules over them is developed to introduce K-motives of algebraic varieties. As an application, bivariant algebraic K-theory as well as bivariant motivic kohomology groups are defined…

K-Theory and Homology · Mathematics 2012-09-12 Grigory Garkusha , Ivan Panin

The cornerstones of the Cellular Automaton Interpretation of Quantum Mechanics are its underlying ontological states that evolve by permutations. They do not create would-be quantum mechanical superposition states. We review this with a…

Quantum Physics · Physics 2025-04-10 Hans-Thomas Elze

A theorem of Cobham says that if $k$ and $\ell$ are two multiplicatively independent natural numbers then a subset of the natural numbers that is both $k$- and $\ell$-automatic is eventually periodic. A multidimensional extension was later…

Formal Languages and Automata Theory · Computer Science 2023-04-20 Seda Albayrak , Jason Bell

We describe an algebra for composing automata in which the actions have probabilities. We illustrate by showing how to calculate the probability of reaching deadlock in k steps in a model of the classical Dining Philosopher problem, and…

Logic in Computer Science · Computer Science 2009-01-19 L. de Francesco Albasini , N. Sabadini , R. F. C. Walters

We give the automata which describe time evolution rules of the box-ball system (BBS) with a carrier. It can be shown by use of tropical geometry, such systems are ultradiscrete analogues of KdV equation. We discuss their relation with the…

Spectral Theory · Mathematics 2016-05-04 Tsuyoshi Kato , Satoshi Tsujimoto , Andrzej Zuk

This paper connects the classes of weighted alternating finite automata (WAFA), weighted finite tree automata (WFTA), and polynomial automata (PA). First, we investigate the use of trees in the run semantics for weighted alternating…

Logic in Computer Science · Computer Science 2024-02-14 Gustav Grabolle

Alternating automata have been widely used to model and verify systems that handle data from finite domains, such as communication protocols or hardware. The main advantage of the alternating model of computation is that complementation is…

Formal Languages and Automata Theory · Computer Science 2017-08-17 Radu Iosif , Xiao Xu

We present a method to prove the decidability of provability in several well-known inference systems. This method generalizes both cut-elimination and the construction of an automaton recognizing the provable propositions.

Logic in Computer Science · Computer Science 2016-01-08 Gilles Dowek , Ying Jiang

Using Albert results we argue that we don't need new physics to understand G\"odelization. Albert quantum automaton can "understand" both a formal system and a G\"odel proposition which can't be obtained within this system. There are two…

Quantum Physics · Physics 2007-05-23 A. V. Yurov

Higher-dimensional automata constitute a very expressive model for concurrent systems. In this paper, we discuss "topological abstraction" of higher-dimensional automata, i.e., the replacement of HDAs by smaller ones that can be considered…

Formal Languages and Automata Theory · Computer Science 2015-06-09 Thomas Kahl

Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates…

Quantum Physics · Physics 2019-09-09 Pablo Arrighi

Given a $k$-graph $\Lambda $ we construct a Markov space $M_\Lambda $, and a collection of $k$ pairwise commuting cellular automata on $M_\Lambda $, providing for a factorization of Markov's shift. Iterating these maps we obtain an action…

Operator Algebras · Mathematics 2018-09-14 R. Exel , B. Steinberg

This is the second part of a work devoted to the study of linear Mahler systems in several variables from the perspective of transcendence and algebraic independence. From the lifting theorem obtained in the first part, we first derive a…

Number Theory · Mathematics 2018-09-14 Boris Adamczewski , Colin Faverjon

A simple modification of the definition of the S-matrix is proposed. It is expected that the divergences related to nonzero self-energies are considerably milder with the modified definition than with the usual one. This conjecture is…

High Energy Physics - Theory · Physics 2011-04-07 Gabor Zsolt Toth

We show how methods from K-theory of operator algebras can be applied in a completely algebraic setting to define a bivariant, matrix-stable, homotopy-invariant, excisive K-theory of algebras over a fixed unital ground ring H, kk_*(A,B),…

K-Theory and Homology · Mathematics 2011-08-03 Guillermo Cortiñas , Andreas Thom
‹ Prev 1 3 4 5 6 7 10 Next ›