We investigate the theory of skew (formal) power series introduced by Droste, Kuske [5, 6], if the basic semiring is a Conway semiring. This yields Kleene Theorems for skew power series, whose supports contain finite and infinite words. We then develop a theory of convergence in semirings of skew power series based on the discrete convergence. As an application this yields a Kleene Theorem proved already by Droste, Kuske [5]
Kleene algebras are an important class of algebraic structures that arise in diverse areas of compu...
The main result of this thesis is the generalization of the Kleene-theorem to formal tree-series ove...
AbstractIteration semi-rings are Conway semi-rings satisfying Conway’s group identities. We show tha...
One of the most well-known induction principles in computer scienceis the fixed point induction rule...
Weighted ω-pushdown automata were introduced as generalization of the classical pushdown automata ac...
AbstractOne of the most well-known induction principles in computer science is the fixed point induc...
AbstractKleene's theorem on the coincidence of regular and rational languages in free monoids has be...
AbstractWe derive Schützenberger’s characterisation of the set of recognizable formal power series a...
AbstractKleene's theorem on the coincidence of regular and rational languages in free monoids has be...
AbstractRational and pushdown transductions of formal languages are generalized to formal power seri...
International audienceWe define and study basic properties of *-continuous Kleene ω-algebras that in...
AbstractWe define two types of series over Σ-algebras: formal series and, as a special case, term se...
AbstractWe generalize the following two language- and automata-theoretic results to ω-continuous sem...
We define rationally additive semirings that are a generalization of (omega-)complete and (omega-)co...
AbstractA Kleene algebra (K,+,·,*,0,1) is an idempotent semiring with an iteration * as axiomatised ...
Kleene algebras are an important class of algebraic structures that arise in diverse areas of compu...
The main result of this thesis is the generalization of the Kleene-theorem to formal tree-series ove...
AbstractIteration semi-rings are Conway semi-rings satisfying Conway’s group identities. We show tha...
One of the most well-known induction principles in computer scienceis the fixed point induction rule...
Weighted ω-pushdown automata were introduced as generalization of the classical pushdown automata ac...
AbstractOne of the most well-known induction principles in computer science is the fixed point induc...
AbstractKleene's theorem on the coincidence of regular and rational languages in free monoids has be...
AbstractWe derive Schützenberger’s characterisation of the set of recognizable formal power series a...
AbstractKleene's theorem on the coincidence of regular and rational languages in free monoids has be...
AbstractRational and pushdown transductions of formal languages are generalized to formal power seri...
International audienceWe define and study basic properties of *-continuous Kleene ω-algebras that in...
AbstractWe define two types of series over Σ-algebras: formal series and, as a special case, term se...
AbstractWe generalize the following two language- and automata-theoretic results to ω-continuous sem...
We define rationally additive semirings that are a generalization of (omega-)complete and (omega-)co...
AbstractA Kleene algebra (K,+,·,*,0,1) is an idempotent semiring with an iteration * as axiomatised ...
Kleene algebras are an important class of algebraic structures that arise in diverse areas of compu...
The main result of this thesis is the generalization of the Kleene-theorem to formal tree-series ove...
AbstractIteration semi-rings are Conway semi-rings satisfying Conway’s group identities. We show tha...