Counting distinct strings
From MaRDI portal
Publication:1277320
DOI10.1007/PL00009247zbMATH Open0913.68088OpenAlexW1968529705MaRDI QIDQ1277320FDOQ1277320
Authors: K. Appert 
Publication date: 2 February 1999
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009247
Recommendations
- Counting dependent and independent strings
- Counting Dependent and Independent Strings
- Counting suffix arrays and strings
- Counting certain binary strings
- scientific article; zbMATH DE number 3974323
- Counting words by number of occurrences of some patterns
- Strings with maximally many distinct subsequences and substrings
- Counting cyclic binary strings
- scientific article; zbMATH DE number 3976360
Cited In (19)
- Representing prefix and border tables: results on enumeration
- Inferring strings from suffix trees and links on a binary alphabet
- On maximal unbordered factors
- Combinatorics on partial word borders
- Counting certain binary strings
- Border correlation of binary words
- Inferring strings from Lyndon factorization
- Counting suffix arrays and strings
- Counting Strings with Given Elementary Symmetric Function Evaluations I: Strings over \boldmath$\mathbbZ_p$ withpPrime
- Efficient validation and construction of border arrays and validation of string matching automata
- Validating the Knuth-Morris-Pratt failure function, fast and online
- Counting Parameterized Border Arrays for a Binary Alphabet
- Counting Dependent and Independent Strings
- Verifying and enumerating parameterized border arrays
- New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings
- Another way to count characters
- Inferring an indeterminate string from a prefix graph
- Title not available (Why is that?)
- Counting Colours in Compressed Strings
This page was built for publication: Counting distinct strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1277320)
