Comparing subword occurrences in binary D0L sequences (Q3401488)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5664854
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparing subword occurrences in binary D0L sequences |
scientific article; zbMATH DE number 5664854 |
Statements
COMPARING SUBWORD OCCURRENCES IN BINARY D0L SEQUENCES (English)
0 references
29 January 2010
0 references
subword
0 references
scattered subword
0 references
subword balance
0 references
iterated morphism
0 references
D0L system
0 references
Parikh matrix
0 references
0.8440464735031128
0 references
0.8368414044380188
0 references
0.7815920114517212
0 references
