Add to ORKGincollectionWe present the state of the art in the field of generating series for formal languages. The emphasis is on regular languages and rational series. The paper covers aspects including regular trees and the Kraft-McMillan inequality as well as necklaces and zeta functions
We study in combinatorics objects with a size (size in informatics setting can be the memory space u...
We study in combinatorics objects with a size (size in informatics setting can be the memory space u...
AbstractWe define two types of series over Σ-algebras: formal series and, as a special case, term se...
incollectionWe present the state of the art in the field of generating series for formal languages. ...
Abstract We present the state of the art in the field of generating series for formal languages. The...
incollectionWe present the state of the art in the field of generating series for formal languages. ...
This booklet develops in nearly 200 pages the basics of combinatorial enumeration through an approac...
International audienceThe main result is a characterization of the generating sequences of the lengt...
AbstractWe present a theory of generating functions in countably many non-commuting variables. This ...
AbstractThis paper presents a combinatorial theory of formal power series. The combinatorial interpr...
International audienceThis paper presents a survey on length distributions of regular languages. The...
International audienceCombinatorics on words is a field which has both historical roots and a substa...
International audienceCombinatorics on words is a field which has both historical roots and a substa...
AbstractThe technique of determining a generating function for an unambiguous context-free language ...
AbstractIn this paper, we tackle the problem of giving, by means of a regular language, a combinator...
We study in combinatorics objects with a size (size in informatics setting can be the memory space u...
We study in combinatorics objects with a size (size in informatics setting can be the memory space u...
AbstractWe define two types of series over Σ-algebras: formal series and, as a special case, term se...
incollectionWe present the state of the art in the field of generating series for formal languages. ...
Abstract We present the state of the art in the field of generating series for formal languages. The...
incollectionWe present the state of the art in the field of generating series for formal languages. ...
This booklet develops in nearly 200 pages the basics of combinatorial enumeration through an approac...
International audienceThe main result is a characterization of the generating sequences of the lengt...
AbstractWe present a theory of generating functions in countably many non-commuting variables. This ...
AbstractThis paper presents a combinatorial theory of formal power series. The combinatorial interpr...
International audienceThis paper presents a survey on length distributions of regular languages. The...
International audienceCombinatorics on words is a field which has both historical roots and a substa...
International audienceCombinatorics on words is a field which has both historical roots and a substa...
AbstractThe technique of determining a generating function for an unambiguous context-free language ...
AbstractIn this paper, we tackle the problem of giving, by means of a regular language, a combinator...
We study in combinatorics objects with a size (size in informatics setting can be the memory space u...
We study in combinatorics objects with a size (size in informatics setting can be the memory space u...
AbstractWe define two types of series over Σ-algebras: formal series and, as a special case, term se...