The smallest automaton recognizing the subwords of a text (Q1063423): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q29036151, #quickstatements; #temporary_batch_1706300061798 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q29036151 / rank | |||
Normal rank | |||
Revision as of 22:17, 26 January 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
