A Language-Theoretic View on Network Protocols. - Pierre Ganty; Boris Köpf; Pedro Valero 001 (ATVA, 2017)

Regular Expression Search on Compressed Text. - Pierre Ganty; Pedro Valero 001 (DCC, 2019)

A Congruence-based Perspective on Automata Minimization Algorithms. - Pierre Ganty; Elena Gutiérrez; Pedro Valero 001 (MFCS, 2019)

Language Inclusion Algorithms as Complete Abstract Interpretations. - Pierre Ganty; Francesco Ranzato; Pedro Valero 001 (SAS, 2019)

A Quasiorder-Based Perspective on Residual Automata. - Pierre Ganty; Elena Gutiérrez; Pedro Valero 001 (MFCS, 2020)

On the Use of Quasiorders in Formal Language Theory. - Pedro Valero 001 (CoRR, 2020)

On the use of quasiorders in formal language theory. - Pedro Valero 001 (2020)

A Congruence-Based Perspective on Finite Tree Automata. - Pierre Ganty; Elena Gutiérrez; Pedro Valero 001 (Fundam. Informaticae, 2021)

Complete Abstractions for Checking Language Inclusion. - Pierre Ganty; Francesco Ranzato; Pedro Valero 001 (ACM Trans. Comput. Log., 2021)