Related papers: Coalgebras for Bisimulation of Weighted Automata o…
We consider the structures given by repeatedly generalising the definition of finite state automata by symmetry considerations, and constructing analogues of transition monoids at each step. This approach first gives us non-deterministic…
M. Embry and A. Lambert initiated the study of a weighted translation semigroup $\{S_t\}$ in ${\cal B}(L^2({\mathbb R_+})),$ with a view to explore a continuous analogue of a weighted shift operator. We continued the work, characterized…
M. Embry and A. Lambert initiated the study of a semigroup of operators $\{S_t\}$ indexed by a non-negative real number $t$ and termed it as weighted translation semigroup. The operators $S_t$ are defined on $L^2(\mathbb R_+)$ by using a…
We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes of a graph by its states, and checks if the neighbourhood of…
Bialgebrae provide an abstract framework encompassing the semantics of different kinds of computational models. In this paper we propose a bialgebraic approach to the semantics of logic programming. Our methodology is to study logic…
In this paper we investigate the gamma-relative differentiation by the motivation of amending the order of the weighted polynomial approximation on the semiaxis for certain functions. With the help of this we give some definitions of…
The goal of the present paper is to provide a systematic and comprehensive study of rational stochastic languages over a semiring K \in {Q, Q +, R, R+}. A rational stochastic language is a probability distribution over a free monoid…
Equivariant map algebras are Lie algebras of algebraic maps from a scheme (or algebraic variety) to a target finite-dimensional Lie algebra (in the case of the current paper, we assume the latter is a simple Lie algebra) that are…
Multiset automata are a class of automata for which the symbols can be read in any order and obtain the same result. We investigate weighted multiset automata and show how to construct them from weighted regular expressions. We present…
We introduce a general categorical framework for the definition of weak behavioural equivalences, building on and extending recent results in the field. This framework is based on parametrized saturation categories, i.e. categories whose…
Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. Similar to well-known results for monadic second-order logic over trees,…
We find an application in quantum finite automata for the ideas and results of [JL21] and [JL22]. We reformulate quantum finite automata with multiple-time measurements using the algebraic notion of near-ring. This gives a unified…
We construct and study new generalisations to rooted trees and forests of some properties of shuffles of words. First, we build a coproduct on rooted trees which, together with their shuffle, endow them with bialgebra structure. We then…
Fix any Borcherds-Kac-Moody $\mathbb{C}$-Lie algebra (BKM LA) $\mathfrak{g}=\mathfrak{g}(A)$ of BKM-Cartan matrix $A$, and Cartan subalgebra $\mathfrak{h}\subset \mathfrak{g}$. In this paper, we obtain explicit weight formulas of any…
A weight normalization procedure, commonly called pushing, is introduced for weighted tree automata (wta) over commutative semifields. The normalization preserves the recognized weighted tree language even for nondeterministic wta, but it…
Probabilistic automata were introduced by Rabin in 1963 as language acceptors. Two automata are equivalent if and only if they accept each word with the same probability. On the other side, in the process algebra community, probabilistic…
A finite automaton is called bideterministic if it is both deterministic and codeterministic -- that is, if it is deterministic and its transpose is deterministic as well. The study of such automata in a weighted setting is initiated. All…
Building on \'Esik and Kuich's completeness result for finitely weighted Kleene algebra, we establish relational and language completeness results for finitely weighted Kleene algebra with tests. Similarly as \'Esik and Kuich, we assume…
Joint modeling of language and vision has been drawing increasing interest. A multimodal data representation allowing for bidirectional retrieval of images by sentences and vice versa is a key aspect. In this paper we present three…
We introduce a certain restriction of weighted automata over the rationals, called image-binary automata. We show that such automata accept the regular languages, can be exponentially more succinct than corresponding NFAs, and allow for…