Add to ORKGInternational audienceWe prove that cyclic languages are the boolean closure of languages called strongly cyclic languages. The result is used to give another proof of the rationality of the zeta function of rational cyclic languages
We define the degree of aperiodicity of finite automata and show that for every set M of positive in...
International audienceWe study the family of rational sets of words, called completely reducible and...
A cyclic graph language is accepted by a Cayley automaton [2] with pebbles if and only if their orde...
International audienceWe prove that cyclic languages are the boolean closure of languages called str...
International audienceWe prove that cyclic languages are the boolean closure of languages called str...
AbstractWe show that if the zeta function of a regular language L is rational, then there exist cycl...
AbstractWe show that if the zeta function of a regular language L is rational, then there exist cycl...
International audienceWe consider a fragment of a cyclic sequent proof system for Kleene algebra, an...
We define the degree of aperiodicity of finite automata and show that for every set M of positive ...
We consider a fragment of a cyclic sequent proof system for Kleene algebra, and we see it as a compu...
International audienceWe study a cyclic proof system C over regular expression types, inspired by li...
International audienceThe paper investigates classes of languages of innite words with respect to th...
We tackle the problem of studying which kind of functions can occur as complexity functions of forma...
International audienceThe profinite topology is used in rational languages classification. In partic...
AbstractWe study generalized zeta functions of formal languages and series. We give necessary condit...
We define the degree of aperiodicity of finite automata and show that for every set M of positive in...
International audienceWe study the family of rational sets of words, called completely reducible and...
A cyclic graph language is accepted by a Cayley automaton [2] with pebbles if and only if their orde...
International audienceWe prove that cyclic languages are the boolean closure of languages called str...
International audienceWe prove that cyclic languages are the boolean closure of languages called str...
AbstractWe show that if the zeta function of a regular language L is rational, then there exist cycl...
AbstractWe show that if the zeta function of a regular language L is rational, then there exist cycl...
International audienceWe consider a fragment of a cyclic sequent proof system for Kleene algebra, an...
We define the degree of aperiodicity of finite automata and show that for every set M of positive ...
We consider a fragment of a cyclic sequent proof system for Kleene algebra, and we see it as a compu...
International audienceWe study a cyclic proof system C over regular expression types, inspired by li...
International audienceThe paper investigates classes of languages of innite words with respect to th...
We tackle the problem of studying which kind of functions can occur as complexity functions of forma...
International audienceThe profinite topology is used in rational languages classification. In partic...
AbstractWe study generalized zeta functions of formal languages and series. We give necessary condit...
We define the degree of aperiodicity of finite automata and show that for every set M of positive in...
International audienceWe study the family of rational sets of words, called completely reducible and...
A cyclic graph language is accepted by a Cayley automaton [2] with pebbles if and only if their orde...