Related papers: On Continuous Weighted Finite Automata
We propose deterministic timed automata (DTA) as a model-independent language for specifying performance and dependability measures over continuous-time stochastic processes. Technically, these measures are defined as limit frequencies of…
An index for a finite automaton is a powerful data structure that supports locating paths labeled with a query pattern, thus solving pattern matching on the underlying regular language. In this paper, we solve the long-standing problem of…
We introduce Symbolic Alternating Finite Automata (s-AFA) as an expressive, succinct, and decidable model for describing sets of finite sequences over arbitrary alphabets. Boolean operations over s-AFAs have linear complexity, which is in…
We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…
This work considers weak deterministic B\"uchi automata reading encodings of non-negative reals in a fixed base. A Real Number Automaton is an automaton which recognizes all encoding of elements of a set of reals. It is explained how to…
We show that weighted automata over the field of two elements can be exponentially more compact than non-deterministic finite state automata. To show this, we combine ideas from automata theory and communication complexity. However,…
If X is a discrete abelian group and B a finite set, then a cellular automaton (CA) is a continuous map F:B^X-->B^X that commutes with all X-shifts. If g is a real-valued function on B, then, for any b in B^X, we define G(b) to be the sum…
We present an algorithm for regular expression parsing and submatch extraction based on tagged deterministic finite automata. The algorithm works with different disambiguation policies. We give detailed pseudocode for the algorithm,…
We consider the task of computing functions $f: \mathbb{N}^k\to \mathbb{N}$, where $ \mathbb{N}$ is the set of natural numbers, by finite teams of agents modelled as deterministic finite automata. The computation is carried out in a…
The weight maximization problem (WMP) is the problem of finding the word of highest weight on a weighted finite state automaton (WFA). It is an essential question that emerges in many optimization problems in automata theory. Unfortunately,…
Minimal deterministic finite automata (DFAs) can be reduced further at the expense of a finite number of errors. Recently, such minimization algorithms have been improved to run in time O(n log n), where n is the number of states of the…
The homogeneous weights and the M\"obius functions and Euler phi-functions on finite rings are discussed; some computational formulas for these functions on finite principal ideal rings are characterized; for the residue rings of integers,…
The HOM problem, which asks whether the image of a regular tree language under a given tree homomorphism is again regular, is known to be decidable [Godoy & Gim\'enez: The HOM problem is decidable. JACM 60(4), 2013]. However, the problem…
We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages. We show that bounded-error QFAs are more powerful than PFAs. But, in contrary to the…
Automata over infinite words, also known as omega-automata, play a key role in the verification and synthesis of reactive systems. The spectrum of omega-automata is defined by two characteristics: the acceptance condition (e.g. B\"uchi or…
This paper is a continuation of work started in \cite{njampavcont} on preserving continuity in ideal topological spaces. We will deal with $\theta$-continuity and weak continuity and give their translations in ideal topological spaces. As…
We derive a closed-form expression for the finite predictor coefficients of multivariate ARMA (autoregressive moving-average) processes. The expression is given in terms of several explicit matrices that are of fixed sizes independent of…
We present sufficient conditions for topological stability of continuous functions $f:\mathbb{R}\to\mathbb{R}$ having finitely many local extrema with respect to averagings by discrete measures with finite supports.
Estimating causal effects of continuous treatments is a common problem in practice, for example, in studying average dose-response functions. Classical analyses typically assume that all confounders are fully observed, whereas in real-world…
This set of notes re-proves known results on weighted automata (over a field, also known as multiplicity automata). The text offers a unified view on theorems and proofs that have appeared in the literature over decades and were written in…