Christos Kapoutsis

Christos Kapoutsis is an Associate Teaching Professor in the Computer Science Department at Carnegie Mellon University Qatar. His research focuses on theoretical computer science, particularly automata theory and computational complexity. He has contributed extensively to studies on two-way finite automata, nondeterminism, and state complexity. His work includes analyzing the complement problem for alternating automata, exploring reversal hierarchies, and investigating the role of oracles in small automata models.

Key areas of research include the interplay between automata models and complexity classes such as L/poly and NL, as well as the minicomplexity framework for small computational devices. His publications often address foundational questions in formal languages and algorithmic lower bounds. He has also organized conferences like SOFSEM 2020, contributing to academic discourse in theoretical informatics.

No scientific awards or grants are explicitly listed. His advising record is currently unknown. His academic contributions span over two decades, with notable work since 2004 on topics ranging from finite automata to morphological algorithms.