On<i>n</i>-power prefix languages (Q3506249): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A sublinear time string prefix square detection algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The equation \(a_ M=b^ Nc^ P\) in a free group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Disjunctive languages on a free monoid / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some properties of disjunctive languages on a free monoid / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Language-theoretic complexity of disjunctive sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(d\)-minimal languages / rank | |||
Normal rank |
Latest revision as of 11:54, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On<i>n</i>-power prefix languages |
scientific article |
Statements
On<i>n</i>-power prefix languages (English)
0 references
12 June 2008
0 references
disjunctive
0 references
d-primitive
0 references
p-primitive
0 references
primitive
0 references