References

1. Alfred V. Aho, Monica S. Lam, Ravi Sethi & Jeffrey D. Ullman (2007): Compilers (Principles, Techniques and Tools). Pearson, Addison Wesley.
2. Manuel Baclet & Claire Pagetti (2006): Around Hopcroft's Algorithm. In: Oscar Ibarra & Hsu-Chun Yen: Implementation and Application of Automata, LNCS. Springer Verlag, pp. 114–125, doi:10.1007/11812128_12.
3. Markus Boerger, Peter Bumbulis, Dan Nuffer, Ulya Trofimovich & Brian Young (2003-2021): re2c System. https://re2c.org/.
4. Klaus Brouwer, Wolfgang Gellerich & Erhard Ploederer (1998): Myths and Facts about the Efficient Implementation of Finite Automata and Lexical Analysis. In: K. Koskimies: Compiler Construction (CC 1998), LNCS 1383. Springer, pp. 1–15, doi:10.1007/BFb0026419.
5. The Unicode Consortium: Unicode. https://home.unicode.org/.
6. Hana Dusíková (2019-): CTRE (Compile-Time Regular Expressions) Library. https://compile-time.re/.
7. John E. Hopcroft (1971): An n.log(n) algorithm for minimizing the states in a finite automaton. The theory of machines and computations 43, pp. 189–196, doi:10.1016/B978-0-12-417750-5.50022-1.
8. John E. Hopcroft, Rajeev Motwani & Jeffrey D. Ullman (2006): Introduction to Automata Theory, Languages, and Computation, 3d edition. Pearson, Addison Wesley.
9. Michael E Lesk & Eric Schmidt (1975): Lex: A lexical analyzer generator.
10. 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), pp. 59–78, doi:10.1371/journal.pone.0165864.
11. Hans de Nivelle (2021): A Recursive Inclusion Checker for Recursively Defined Subtypes. Modeling and Analysis of Information Systems 28(4), pp. 414–433, doi:10.18255/1818-1015-2021-4-414-433. Available at https://www.mais-journal.ru/jour/article/view/1568.
12. Hans de Nivelle & Dina Muktubayeva (2021): Tokenizer Generation. http://www.compiler-tools.eu/.
13. 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, pp. 2424–2430, doi:10.1016/j.tcs.2009.02.034.
14. Michael Sipser (2013): Introduction to the Theory of Computation (Third Edition). CENGAGE Learning.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org