Algorithm for Constructing a Minimal Deterministic Finite Automaton That Recognizes a Finite Set of Words
Crossref DOI link: https://doi.org/10.3103/S0147688225700522
Published Online: 2026-02-21
Published Print: 2025-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Shiyan, V. I.
Text and Data Mining valid from 2025-12-01
Version of Record valid from 2025-12-01
Article History
Received: 3 January 2024
First Online: 21 February 2026
CONFLICT OF INTEREST
: The author of this work declares that he has no conflicts of interest.