scientific article; zbMATH DE number 3974323
From MaRDI portal
Publication:3740259
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
Cited in
(20)- Counting distinct strings
- Restricted words by adjacencies
- On the Perron root and eigenvectors associated with a subshift of finite type
- scientific article; zbMATH DE number 1577991 (Why is no real title available?)
- Counting cyclic binary strings
- On the enumeration of restricted words over a finite alphabet
- Universal Recursively Enumerable Sets of Strings
- scientific article; zbMATH DE number 3946132 (Why is no real title available?)
- Enumeration of bordered words, le langage de la vache-qui-rit
- scientific article; zbMATH DE number 1919509 (Why is no real title available?)
- Enumerating Neighbour and Closest Strings
- Analytic analysis of algorithms
- scientific article; zbMATH DE number 2202931 (Why is no real title available?)
- Counting Dependent and Independent Strings
- Constructive enumeration of bit strings
- SUBSHIFTS OF FINITE TYPE WITH A HOLE
- Finite time dynamics and finite time predictions for stochastic and deterministic chaotic systems
- Block-distribution in random strings
- Subproduct systems and Cartesian systems: new results on factorial languages and their relations with other areas
- 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)
