Abstract
We 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.
Cite
CITATION STYLE
APA
Perrin, D. (2001). Enumerative combinatorics on words. In Algebraic Combinatorics and Computer Science (pp. 391–427). Springer Milan. https://doi.org/10.1007/978-88-470-2107-5_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free