AlessandroMinisini

I study finite automata through co-lexicographic orders on their states, and the co-lex width that such orders assign to automata and regular languages. My bachelor thesis describes the Hasse automaton, a canonical automaton that achieves the optimal width for a given language, and characterizes the equivalences inducing minimum-state deterministic automata of fixed width. In [1] we consider the non-deterministic width of regular languages in the unary case, that is, for languages $L \subseteq a^*$ over a one-letter alphabet.

In [1] we combine large language models with formal verification tools to detect vulnerabilities in cryptographic protocols automatically.