References

1. Valentin M. Antimirov (1996): Partial Derivatives of Regular Expressions and Finite Automaton Constructions. Theor. Comput. Sci. 155(2), pp. 291–319, doi:10.1016/0304-3975(95)00182-4.
2. Gerard Berry & Ravi Sethi (1986): From regular expressions to deterministic automata. Theoretical computer science 48, pp. 117–126, doi:10.1016/0304-3975(86)90088-5.
3. Janusz A. Brzozowski (1964): Derivatives of Regular Expressions. J. ACM 11(4), pp. 481–494, doi:10.1145/321239.321249.
4. Pascal Caron & Marianne Flouret (2011): From Glushkov WFAs to K-Expressions. Fundam. Informaticae 109(1), pp. 1–25, doi:10.3233/FI-2011-427.
5. Jean-Marc Champarnaud, Éric Laugerotte, Faissal Ouardi & Djelloul Ziadi (2004): From Regular Weighted Expressions To Finite Automata. Int. J. Found. Comput. Sci. 15(5), pp. 687–700, doi:10.1142/S0129054104002698.
6. Thomas Colcombet & Daniela Petrisan (2017): Automata and minimization. SIGLOG News 4(2), pp. 4–27, doi:10.1145/3090064.3090066.
7. Richard A. Eisenberg & Stephanie Weirich (2012): Dependently typed programming with singletons. In: Haskell. ACM, pp. 117–130, doi:10.1145/2364506.2364522.
8. Victor Mikhaylovich Glushkov (1961): The abstract theory of automata. Russian Mathematical Surveys 16(5), pp. 1, doi:10.1070/rm1961v016n05abeh004112.
9. Mark P. Jones (1995): Functional Programming with Overloading and Higher-Order Polymorphism. In: Adv. Func. Prog., LNCS 925. Springer, pp. 97–136, doi:10.1007/3-540-59451-5_4.
10. S. Kleene (1956): Representation of events in nerve nets and finite automata. Automata Studies Ann. Math. Studies 34, pp. 3–41, doi:10.1515/9781400882618-002. Princeton U. Press.
11. Jean-Louis Loday & Bruno Vallette (2012): Algebraic operads 346. Springer Science & Business Media, doi:10.1007/978-3-642-30362-3_5.
12. Sylvain Lombardy & Jacques Sakarovitch (2005): Derivatives of rational expressions with multiplicity. Theor. Comput. Sci. 332(1-3), pp. 141–177, doi:10.1016/j.tcs.2004.10.016.
13. J Peter May (2006): The geometry of iterated loop spaces 271. Springer, doi:10.1007/BFb0067491.
14. Ludovic Mignot: Application: Monadic derivatives. http://ludovicmignot.free.fr/programmes/monDer/index.html. Accessed: 2022-05-26.
15. Ludovic Mignot (2020): Une proposition d'implantation des structures d'automates, d'expressions et de leurs algorithmes associés utilisant les catégories enrichies (in french). Habilitation à diriger des recherches. Université de Rouen normandie, doi:10.48550/arXiv.2012.10641. Available at https://arxiv.org/abs/2012.10641. 212 pages.
16. Ludovic Mignot (2022): Monadic derivatives. https://github.com/LudovicMignot/MonadicDerivatives.
17. Marcel Paul Schützenberger (1961): On the definition of a family of automata. Inf. Control. 4(2-3), pp. 245–270, doi:10.1016/S0019-9958(61)80020-X.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org