The smallest automaton recognizing the subwords of a text (Q1063423)

From MaRDI portal
Revision as of 22:17, 26 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q29036151, #quickstatements; #temporary_batch_1706300061798)
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
    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
    0 references
    minimal automaton
    0 references
    partial deterministic finite automaton
    0 references
    0 references