Shortest characteristic factors of a deterministic finite automaton and computing its positive position run by pattern set matching
Crossref DOI link: https://doi.org/10.1007/s00236-025-00484-0
Published Online: 2025-09-10
Published Print: 2025-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Janoušek, Jan
Plachý, Štěpán
Funding for this research was provided by:
Umea University
Text and Data Mining valid from 2025-09-01
Version of Record valid from 2025-09-10
Article History
Received: 2 May 2024
Accepted: 3 March 2025
First Online: 10 September 2025
Declarations
:
: The authors declare no competing interests.