AbstractWe generalize the following two language- and automata-theoretic results to ω-continuous semirings. •(i) The family of languages accepted by finite automata is the smallest class containing all finite languages and closed under union, product and star (Kleene's Theorem).•(ii) The family of languages accepted by pushdown automata is the family ofcontext-free languages
The family RX∗ of regular subsets of the free monoid X∗ generated by a finite set X is the standard ...
This paper is a survey on the algebraic approach to the theory of automata accepting infinite words....
The family RX∗ of regular subsets of the free monoid X∗ generated by a finite set X is the standard ...
AbstractWe generalize the following two language- and automata-theoretic results to ω-continuous sem...
AbstractRational and pushdown transductions of formal languages are generalized to formal power seri...
Weighted ω-pushdown automata were introduced as generalization of the classical pushdown automata ac...
AbstractEilenberg’s variety theorem gives a bijective correspondence between varieties of languages ...
New families of ω-languages (sets of infinite sequences) associated with context-free languages and ...
We define rationally additive semirings that are a generalization of (ω)-complete and (ω)-continuous...
This chapter gives an overview on what is often called the algebraic theory of finite automata. It d...
International audienceWe define and study basic properties of *-continuous Kleene ω-algebras that in...
AbstractGiven a continuous semiring A and a collection H of semiring morphisms mapping the elements ...
AbstractKleene's theorem on the coincidence of regular and rational languages in free monoids has be...
This thesis treats of recognizable languages of words indexed by ordinals.Several classes of automat...
This thesis treats of recognizable languages of words indexed by ordinals.Several classes of automat...
The family RX∗ of regular subsets of the free monoid X∗ generated by a finite set X is the standard ...
This paper is a survey on the algebraic approach to the theory of automata accepting infinite words....
The family RX∗ of regular subsets of the free monoid X∗ generated by a finite set X is the standard ...
AbstractWe generalize the following two language- and automata-theoretic results to ω-continuous sem...
AbstractRational and pushdown transductions of formal languages are generalized to formal power seri...
Weighted ω-pushdown automata were introduced as generalization of the classical pushdown automata ac...
AbstractEilenberg’s variety theorem gives a bijective correspondence between varieties of languages ...
New families of ω-languages (sets of infinite sequences) associated with context-free languages and ...
We define rationally additive semirings that are a generalization of (ω)-complete and (ω)-continuous...
This chapter gives an overview on what is often called the algebraic theory of finite automata. It d...
International audienceWe define and study basic properties of *-continuous Kleene ω-algebras that in...
AbstractGiven a continuous semiring A and a collection H of semiring morphisms mapping the elements ...
AbstractKleene's theorem on the coincidence of regular and rational languages in free monoids has be...
This thesis treats of recognizable languages of words indexed by ordinals.Several classes of automat...
This thesis treats of recognizable languages of words indexed by ordinals.Several classes of automat...
The family RX∗ of regular subsets of the free monoid X∗ generated by a finite set X is the standard ...
This paper is a survey on the algebraic approach to the theory of automata accepting infinite words....
The family RX∗ of regular subsets of the free monoid X∗ generated by a finite set X is the standard ...
DOI
Add to ORKG