Related papers: Weighted omega-Restricted One Counter Automata
This paper provides a reference description, in the form of a deduction system, of Earley's (1970) context-free parsing algorithm with various speed-ups. Our presentation includes a known worst-case runtime improvement from Earley's $O…
We present counting reward automata-a finite state machine variant capable of modelling any reward function expressible as a formal language. Unlike previous approaches, which are limited to the expression of tasks as regular languages, our…
While weighted automata provide a natural framework to express quantitative properties, many basic properties like average response time cannot be expressed with weighted automata. Nested weighted automata extend weighted automata and…
Weakly recognizing morphisms from free semigroups onto finite semigroups are a classical way for defining the class of omega-regular languages, i.e., a set of infinite words is weakly recognizable by such a morphism if and only if it is…
We introduce layered automata, a subclass of alternating parity automata that generalises deterministic automata. Assuming a consistency property, these automata are history deterministic and 0-1 probabilistic. We show that every…
This paper concerns $\mu$-limit sets of cellular automata: sets of configurations made of words whose probability to appear does not vanish with time, starting from an initial $\mu$-random configuration. More precisely, we investigate the…
The notion of comparison between system runs is fundamental in formal verification. This concept is implicitly present in the verification of qualitative systems, and is more pronounced in the verification of quantitative systems. In this…
We examine two nonselfadjoint operator algebras: the weighted shift algebra, and the Volterra operator algebra. In both cases, the operator algebra is the norm closure of the polynomials in the operator norm. In the case of the weighted…
In previous work "Betweenness algebras" we introduced and examined the class of betweenness algebras. In the current paper we study a larger class of algebras with binary operators of possibility and sufficiency, the weak mixed algebras.…
We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…
We show how up-to techniques for (bi-)similarity can be used in the setting of weighted systems. The problems we consider are language equivalence, language inclusion and the threshold problem (also known as universality problem) for…
This paper investigates composition operators and weighted composition operators on semi-Hilbert spaces induced by positive multiplication operators on \( L^2(\mu) \). Within the framework of \( A \)-adjoint operators, we characterize…
A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of $\omega$-regular languages. The class has two equivalent descriptions: in terms of automata (a type of deterministic counter…
The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule. Given the hardness…
We consider $\omega^n$-automatic structures which are relational structures whose domain and relations are accepted by automata reading ordinal words of length $\omega^n$ for some integer $n\geq 1$. We show that all these structures are…
There is a local ring $E$ of order $4,$ without identity for the multiplication, defined by generators and relations as $E=\langle a,b \mid 2a=2b=0,\, a^2=a,\, b^2=b,\,ab=a,\, ba=b\rangle.$ We study a special construction of self-orthogonal…
Designers of statistical machine translation (SMT) systems have begun to employ tree-structured translation models. Systems involving tree-structured translation models tend to be complex. This article aims to reduce the conceptual…
Let K be an algebraically closed field of characteristic zero, endowed with a complete nonarchimedean norm. Let X be a K-rigid analytic variety and \Sigma a semianalytic subset of X. Then the closure of \Sigma in X with respect to the…
Suppose that M is countable, binary, primitive, homogeneous, and simple, and hence 1-based. We prove that the SU-rank of the complete theory of M is~1. It follows that M is a random structure. The conclusion that M is a random structure…
In this paper we obtain complexity bounds for computational problems on algebraic power series over several commuting variables. The power series are specified by systems of polynomial equations: a formalism closely related to weighted…