Weighted ω-pushdown automata were introduced as generalization of the classical pushdown automata accepting infinite words by Büchi acceptance. The main result in the proof of the Kleene Theorem is the construction of a weighted ω-pushdown automaton for the ω-algebraic closure of subsets of a continuous star-omega semiring
We associate with every commutative continuous semiring S and alphabet Σ a category whose objects ar...
In this paper we present a detailed proof of an important result of algebraic logic: namely that the...
AbstractRational and pushdown transductions of formal languages are generalized to formal power seri...
AbstractWe generalize the following two language- and automata-theoretic results to ω-continuous sem...
We investigate the theory of skew (formal) power series introduced by Droste, Kuske [5, 6], if the b...
International audienceWe define and study basic properties of *-continuous Kleene ω-algebras that in...
AbstractOne of the most well-known induction principles in computer science is the fixed point induc...
AbstractWe generalize the following two language- and automata-theoretic results to ω-continuous sem...
The family RX∗ of regular subsets of the free monoid X∗ generated by a finite set X is the standard ...
The family RX∗ of regular subsets of the free monoid X∗ generated by a finite set X is the standard ...
We introduce weighted variable automata over infinite alphabets and commutative semirings. We prove ...
The family RX∗ of regular subsets of the free monoid X∗ generated by a finite set X is the standard ...
AbstractA Kleene algebra (K,+,·,*,0,1) is an idempotent semiring with an iteration * as axiomatised ...
One of the most well-known induction principles in computer scienceis the fixed point induction rule...
AbstractWe derive Schützenberger’s characterisation of the set of recognizable formal power series a...
We associate with every commutative continuous semiring S and alphabet Σ a category whose objects ar...
In this paper we present a detailed proof of an important result of algebraic logic: namely that the...
AbstractRational and pushdown transductions of formal languages are generalized to formal power seri...
AbstractWe generalize the following two language- and automata-theoretic results to ω-continuous sem...
We investigate the theory of skew (formal) power series introduced by Droste, Kuske [5, 6], if the b...
International audienceWe define and study basic properties of *-continuous Kleene ω-algebras that in...
AbstractOne of the most well-known induction principles in computer science is the fixed point induc...
AbstractWe generalize the following two language- and automata-theoretic results to ω-continuous sem...
The family RX∗ of regular subsets of the free monoid X∗ generated by a finite set X is the standard ...
The family RX∗ of regular subsets of the free monoid X∗ generated by a finite set X is the standard ...
We introduce weighted variable automata over infinite alphabets and commutative semirings. We prove ...
The family RX∗ of regular subsets of the free monoid X∗ generated by a finite set X is the standard ...
AbstractA Kleene algebra (K,+,·,*,0,1) is an idempotent semiring with an iteration * as axiomatised ...
One of the most well-known induction principles in computer scienceis the fixed point induction rule...
AbstractWe derive Schützenberger’s characterisation of the set of recognizable formal power series a...
We associate with every commutative continuous semiring S and alphabet Σ a category whose objects ar...
In this paper we present a detailed proof of an important result of algebraic logic: namely that the...
AbstractRational and pushdown transductions of formal languages are generalized to formal power seri...
DOI
Add to ORKG