The smallest automaton recognizing the subwords of a text (Q1063423)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The smallest automaton recognizing the subwords of a text |
scientific article; zbMATH DE number 3917741
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The smallest automaton recognizing the subwords of a text |
scientific article; zbMATH DE number 3917741 |
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
