The smallest automaton recognizing the subwords of a text (Q1063423): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q29036151, #quickstatements; #temporary_batch_1706300061798 |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: PATRICIA / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0304-3975(85)90157-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1972770363 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient string matching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3723739 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal off-line detection of repetitions in a string / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3690245 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3217631 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A fast string searching algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3690247 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3692898 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5592246 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Pattern Matching in Strings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient On-Line Construction and Correction of Position Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Space-Economical Suffix Tree Construction Algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear Automaton Transformations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear Algorithm for Data Compression via String Matching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3936191 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4160412 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3885189 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:58, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The smallest automaton recognizing the subwords of a text |
scientific article |
Statements
The smallest automaton recognizing the subwords of a text (English)
0 references
1985
0 references
See the review of the preliminary version [Lect. Notes Comput. Sci. 172, 109-118 (1984; Zbl 0554.68058)].
0 references
minimal automaton
0 references
partial deterministic finite automaton
0 references