LTL Can Be More Succinct. - Kamal Lodaya; A. V. Sreejith (ATVA, 2010)

Expressive Completeness for LTL With Modulo Counting and Group Quantifiers. - A. V. Sreejith (M4M/LAMAS, 2011)

Non-definability of Languages by Generalized First-order Formulas over (N, +). - Andreas Krebs; A. V. Sreejith (LICS, 2012)

On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains. - Vikraman Arvind; S. Raja 001; A. V. Sreejith (CSR, 2014)

Limited Set quantifiers over Countable Linear Orderings. - Thomas Colcombet; A. V. Sreejith (ICALP (2), 2015)

Two-Variable Logic over Countable Linear Orderings. - Amaldev Manuel; A. V. Sreejith (MFCS, 2016)

Two-Variable First Order Logic with Counting Quantifiers: Complexity Results. - Kamal Lodaya; A. V. Sreejith (DLT, 2017)

Undecidability of MSO+"ultimately periodic". - Mikolaj Bojanczyk; Laure Daviaud; Bruno Guillon; Vincent Penelle; A. V. Sreejith (CoRR, 2018)

Block products for algebras over countable words and applications to logic. - Bharat Adsul; Saptarshi Sarkar 001; A. V. Sreejith (LICS, 2019)

Undecidability of a weak version of MSO+U. - Mikolaj Bojanczyk; Laure Daviaud; Bruno Guillon; Vincent Penelle; A. V. Sreejith (Log. Methods Comput. Sci., 2020)

First-Order Logic and Its Infinitary Quantifier Extensions over Countable Words. - Bharat Adsul; Saptarshi Sarkar 001; A. V. Sreejith (FCT, 2021)

Weighted One-Deterministic-Counter Automata. - Prince Mathew 001; Vincent Penelle; Prakash Saivasan; A. V. Sreejith (FSTTCS, 2023)

One Deterministic-Counter Automata. - Prince Mathew 001; Vincent Penelle; Prakash Saivasan; A. V. Sreejith (CoRR, 2023)

Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words. - Bharat Adsul; Saptarshi Sarkar 001; A. V. Sreejith (J. Comput. Syst. Sci., 2023)

Equivalence of Deterministic Weighted Real-Time One-Counter Automata. - Prince Mathew 001; Vincent Penelle; Prakash Saivasan; A. V. Sreejith (ICLA, 2025)

Learning Real-Time One-Counter Automata Using Polynomially Many Queries. - Prince Mathew 001; Vincent Penelle; A. V. Sreejith (TACAS (1), 2025)

Learning Deterministic One-Counter Automata in Polynomial Time. - Prince Mathew 001; Vincent Penelle; A. V. Sreejith (CoRR, 2025)

Regular expressions over countable words. - Thomas Colcombet; A. V. Sreejith (CoRR, 2025)