Alfred V. Aho
Monica S. Lam
Ravi Sethi
Jeffrey D. Ullman
2007
Compilers (Principles, Techniques and Tools)
Pearson, Addison Wesley
Manuel Baclet
Claire Pagetti
2006
Around Hopcroft's Algorithm
Oscar Ibarra
Hsu-Chun Yen
Implementation and Application of Automata
LNCS
Springer Verlag
114–125
10.1007/11812128_12
Markus Boerger
Peter Bumbulis
Dan Nuffer
Ulya Trofimovich
Brian Young
2003-2021
re2c System
https://re2c.org/
Klaus Brouwer
Wolfgang Gellerich
Erhard Ploederer
1998
Myths and Facts about the Efficient Implementation of Finite Automata and Lexical Analysis
K. Koskimies
Compiler Construction (CC 1998)
LNCS 1383
Springer
1–15
10.1007/BFb0026419
The Unicode Consortium
Unicode
https://home.unicode.org/
Hana Dusíková
2019-
CTRE (Compile-Time Regular Expressions) Library
https://compile-time.re/
John E. Hopcroft
1971
An n.log(n) algorithm for minimizing the states in a finite automaton
The theory of machines and computations
43
189–196
10.1016/B978-0-12-417750-5.50022-1
John E. Hopcroft
Rajeev Motwani
Jeffrey D. Ullman
2006
Introduction to Automata Theory, Languages, and Computation
3d
Pearson, Addison Wesley
Michael E Lesk
Eric Schmidt
1975
Lex: A lexical analyzer generator
Desheng Liu
Zhiping Huang
Yimeng Zhang
Xiaojun Guo
Shaojing Su
2016
Efficient Deterministic Finite Automata Minimization Based on Backward Depth Information
PLOS ONE
11
11
59–78
10.1371/journal.pone.0165864
Hans de Nivelle
2021
A Recursive Inclusion Checker for Recursively Defined Subtypes
Modeling and Analysis of Information Systems
28
4
414–433
10.18255/1818-1015-2021-4-414-433
https://www.mais-journal.ru/jour/article/view/1568
Hans de Nivelle
Dina Muktubayeva
2021
Tokenizer Generation
http://www.compiler-tools.eu/
Andrei Păun
Mihaela Păun
Alfonso Rodríguez-Páton
2009
On the Hopcroft’s minimization technique for DFA and DFCA
theoretical computer science
2424–2430
10.1016/j.tcs.2009.02.034
Michael Sipser
2013
Introduction to the Theory of Computation (Third Edition)
CENGAGE Learning