AbstractWe show that if the zeta function of a regular language L is rational, then there exist cyclic languages L1 and L2 such that the generating function of L is the difference of the generating functions of L1 and L2. We show also that it is decidable whether or not the zeta function of a given regular language is rational. If it is rational, it can be computed effectively
We prove that the partial zeta function introduced in [9] is a rational function, generalizing Dwork...
We give an exact description of the counting function of a sparse context-free language. Let L be a ...
Let L-phi,L-lambda = {omega is an element of Sigma* vertical bar phi(omega) > lambda} be the languag...
AbstractWe show that if the zeta function of a regular language L is rational, then there exist cycl...
AbstractWe study generalized zeta functions of formal languages and series. We give necessary condit...
AbstractWe study generalized zeta functions of formal languages and series. We give necessary condit...
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...
In this paper, we tackle the problem of giving, by means of a regular language, a combinatorial inte...
In this paper, we tackle the problem of giving, by means of a regular language, a combinatorial inte...
In this paper, we tackle the problem of giving, by means of a regular language, a combinatorial inte...
International audienceWe prove that cyclic languages are the boolean closure of languages called str...
AbstractTwo properties of languages which are supports of rational power series are proved: (i) if t...
AbstractWe consider the zeta and Möbius functions of a partial order on integer compositions first s...
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer....
We prove that the partial zeta function introduced in [9] is a rational function, generalizing Dwork...
We give an exact description of the counting function of a sparse context-free language. Let L be a ...
Let L-phi,L-lambda = {omega is an element of Sigma* vertical bar phi(omega) > lambda} be the languag...
AbstractWe show that if the zeta function of a regular language L is rational, then there exist cycl...
AbstractWe study generalized zeta functions of formal languages and series. We give necessary condit...
AbstractWe study generalized zeta functions of formal languages and series. We give necessary condit...
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...
In this paper, we tackle the problem of giving, by means of a regular language, a combinatorial inte...
In this paper, we tackle the problem of giving, by means of a regular language, a combinatorial inte...
In this paper, we tackle the problem of giving, by means of a regular language, a combinatorial inte...
International audienceWe prove that cyclic languages are the boolean closure of languages called str...
AbstractTwo properties of languages which are supports of rational power series are proved: (i) if t...
AbstractWe consider the zeta and Möbius functions of a partial order on integer compositions first s...
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer....
We prove that the partial zeta function introduced in [9] is a rational function, generalizing Dwork...
We give an exact description of the counting function of a sparse context-free language. Let L be a ...
Let L-phi,L-lambda = {omega is an element of Sigma* vertical bar phi(omega) > lambda} be the languag...
DOI
Add to ORKG