Transducers and repetitions (Q1820587): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q61677987, #quickstatements; #temporary_batch_1703753727431 |
Created claim: DBLP publication ID (P1635): journals/tcs/Crochemore86, #quickstatements; #temporary_batch_1731468600454 |
||
| (4 intermediate revisions by 4 users not shown) | |||
| 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(86)90041-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2154104338 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient string matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the computational power of pushdown automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The theory of languages / 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: Q3859267 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The smallest automaton recognizing the subwords of a text / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast string searching algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3673134 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3692898 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Pattern Matching in Strings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3659988 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3690246 / 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: Q3885189 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Compression of individual sequences via variable-rate coding / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/tcs/Crochemore86 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 04:51, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Transducers and repetitions |
scientific article |
Statements
Transducers and repetitions (English)
0 references
1986
0 references
The factor transducer of a word associates to each of its factors (or subwords) their first occurrence. Optimal bounds on the size of minimal factor transducers together with an algorithm for building them are given. Analogous results and a simple algorithm are given for the case of subsequential suffix transducers. Algorithms are applied to repetition searching in words.
0 references
factor transducer of a word
0 references
subsequential suffix transducers
0 references
Algorithms
0 references
repetition searching in words
0 references
