Skip to main content
Book Chapter

Enumeration of Strings

  • Odlyzko A
Springer Berlin Heidelberg, (1985), 205-228
DOI: 10.1007/978-3-642-82456-2_14
N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A survey is presented of some methods and results on counting words that satisfy various restrictions on subwords (i.e., blocks of consecutive symbols). Various applications to commafree codes, games, pattern matching, and other subjects are indicated. The emphasis is on the unified treatment of those topics through the use of generating functions.

Cite

CITATION STYLE

APA

Odlyzko, A. M. (1985). Enumeration of Strings. In Combinatorial Algorithms on Words (pp. 205–228). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-82456-2_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free