An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms (Q3618580): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_16 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1549821250 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Freeness of partial words / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A generalization of Thue freeness for partial words / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Overlap-freeness in infinite partial words / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4341774 / rank | |||
Normal rank | |||
Latest revision as of 11:15, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms |
scientific article |
Statements
An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms (English)
0 references
2 April 2009
0 references
