scientific article; zbMATH DE number 3974323
From MaRDI portal
Publication:3740259
zbMATH Open0603.68074MaRDI QIDQ3740259FDOQ3740259
Authors: Andrew Odlyzko 
Publication date: 1985
Title of this publication is not available (Why is that?)
Recommendations
- Enumerating the strings of regular languages
- Counting distinct strings
- Enumerating Neighbour and Closest Strings
- Enumeration and generation with a string automata representation
- Universal recursively enumerable sets of strings
- Universal Recursively Enumerable Sets of Strings
- Counting suffix arrays and strings
- Constructive enumeration of bit strings
- Counting Dependent and Independent Strings
Prefix, length-variable, comma-free codes (94A45) Discrete mathematics in relation to computer science (68R99)
Cited In (17)
- Title not available (Why is that?)
- Block-distribution in random strings
- Enumerating Neighbour and Closest Strings
- Counting cyclic binary strings
- On the enumeration of restricted words over a finite alphabet
- SUBSHIFTS OF FINITE TYPE WITH A HOLE
- Constructive enumeration of bit strings
- On the Perron root and eigenvectors associated with a subshift of finite type
- Title not available (Why is that?)
- Universal Recursively Enumerable Sets of Strings
- Counting Dependent and Independent Strings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Counting distinct strings
- Enumeration of bordered words, le langage de la vache-qui-rit
- Analytic analysis of algorithms
- Asymptotic normality and strong consistency of maximum quasi-likelihood estimates in generalized linear models
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3740259)
