# Amaldev Manuel

Visiting Faculty

Chennai Mathematical Institute

Research Interests: Logic, Automata, Algebra and Games

Chennai Mathematical Institute
H1, SIPCOT IT Park, Siruseri
Kelambakkam 603103
India

## Publications

• Two-variable logic over countable linear orderings, with Sreejith A V, Mathematical Foundations of Computer Science (MFCS) 2016. PDF Long Abstract
• Cost Functions Definable by Min/Max Automata, with Thomas Colcombet, Denis Kuperberg, and Szymon Toruńczyk, Symposium on Theoretical Aspects of Computer Science (STACS) 2016. PDF Abstract
• Walking on datawords, with Anca Muscholl and Gabriele Puppis, Theory of Computing Systems, 59(2):180-208, 2016. PDF Abstract
• Fragments of Fixpoint Logic on Data Words, with Thomas Colcombet, Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2015. PDF Short Abstract
• Combinatorial Expressions and lowerbounds, with Thomas Colcombet, Symposium on Theoretical Aspects of Computer Science (STACS) 2015. PDF Short Abstract
• Generalized data automata and fixpoint logic, with Thomas Colcombet, Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2014. PDF Abstract
• Definability and transformations for cost logics and automatic structures, with Martin Lang and Christof Löding, Mathematical Foundations of Computer Science (MFCS) 2014. PDF Abstract
• Two variable logic on two dimensional structures, with Thomas Zeume, Computer Science Logic (CSL) 2013. PDF Short Abstract
• Walking on datawords, with Anca Muscholl and Gabriele Puppis, Computer Science in Russia (CSR) 2013. PDF Abstract
• Counter automata and classical logics for datawords Ph.D. Thesis. Homi Bhabha National Institute, Institute of Mathematical Sciences, Chennai 2012. Thesis Synopsis Summary Slides
• Automata on infinite alphabets, with R. Ramanujam, IISc Research Monographs Series: Volume 2, Modern Applications of Automata Theory, World Scientific 2012. PDF Abstract
• Class counting automata on data words, with R. Ramanujam, International Journal on Foundations of Computer Science (IJFCS), 22(4): 863-882, 2011. PDF Abstract
• Two variables and two successors, Mathematical Foundations of Computer Science (MFCS) 2010. PDF Abstract
• Counting multiplicity over infinite alphabets, with R. Ramanujam, Reachability Problems 2009. PDF Abstract
• LTL with a suborder, European Summer School on Languages Logic and Information (ESSLLI) 2009. PDF Abstract

## Unpublished Manuscripts

• $\mu$-Calculus on data words, with Thomas Colcombet,2014. PDF Abstract
• Uniformization results in regular cost functions, with Thomas Colcombet and Stefan Göller, 2013. PDF Abstract
• A Short Note on Two-Variable Logic with a Linear Order Successor and a Preorder Successor, with Thomas Schwentick and Thomas Zeume, 2013. PDF Abstract

## Slides

Page last updated : 15 Jul 2016.