A. V. Sreejith

Publication Activity (10 Years)

Years Active: 2010-2023
Publications (10 Years): 10

Top Topics

First Order Logic

Probabilistic Graphical Models

Quantifier Free

Top Venues

J. Comput. Syst. Sci.

Publications

Prince Mathew, Vincent Penelle, Prakash Saivasan, A. V. Sreejith
Weighted One-Deterministic-Counter Automata. FSTTCS (2023)
Prince Mathew, Vincent Penelle, Prakash Saivasan, A. V. Sreejith
One Deterministic-Counter Automata. CoRR (2023)
Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith
Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words. J. Comput. Syst. Sci. 136 (2023)
Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith
First-Order Logic and Its Infinitary Quantifier Extensions over Countable Words. FCT (2021)
Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith
First-Order logic and its Infinitary Quantifier Extensions over Countable Words. CoRR (2021)
Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith
Undecidability of a weak version of MSO+U. Log. Methods Comput. Sci. 16 (1) (2020)
Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith
Block products for algebras over countable words and applications to logic. LICS (2019)
Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith
Undecidability of MSO+"ultimately periodic". CoRR (2018)
Kamal Lodaya, A. V. Sreejith
Two-Variable First Order Logic with Counting Quantifiers: Complexity Results. DLT (2017)
Amaldev Manuel, A. V. Sreejith
Two-Variable Logic over Countable Linear Orderings. MFCS (2016)
Thomas Colcombet, A. V. Sreejith
Limited Set quantifiers over Countable Linear Orderings. ICALP (2) (2015)
Vikraman Arvind, S. Raja, A. V. Sreejith
On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains. CSR (2014)
Andreas Krebs, A. V. Sreejith
Non-definability of languages by generalized first-order formulas over (N,+) CoRR (2012)
Andreas Krebs, A. V. Sreejith
Non-definability of Languages by Generalized First-order Formulas over (N, +). LICS (2012)
A. V. Sreejith
Expressive Completeness for LTL With Modulo Counting and Group Quantifiers. Electron. Notes Theor. Comput. Sci. 278 (2011)
Kamal Lodaya, A. V. Sreejith
LTL Can Be More Succinct. ATVA (2010)