Asst. Prof. Cadilhac studies automata theory through the lens of algebra and combinatorics, with applications to formal software verification and high-performance computing. His most important results are at the confluence of regular languages, circuit complexity, and algebraic language theory. He joined DePaul in 2019 and has been teaching topics revolving around both low-level computer science (assembly, C, and systems) and its high-level mathematical abstraction (automata theory, theory of computation).
Research Area
Theory
Specific Research Area
automata theory, circuit complexity, descriptive complexity, computational complexity, formal language theory, verification.