COUNTING SUBWORDS USING A TRIE AUTOMATON (Q3173481): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Generalizations of Parikh mappings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A sharpening of the Parikh mapping / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subword histories and Parikh matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Context-Free Languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4714446 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subword histories and associated matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extending Parikh matrices / rank | |||
Normal rank |
Latest revision as of 11:44, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | COUNTING SUBWORDS USING A TRIE AUTOMATON |
scientific article |
Statements
COUNTING SUBWORDS USING A TRIE AUTOMATON (English)
0 references
10 October 2011
0 references
Parikh mapping
0 references
Parikh matrix
0 references
scattered subword
0 references
trie automaton
0 references