A. V. Sreejith

According to our database, A. V. Sreejith authored at least 14 papers between 2010 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words.

Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith

J. Comput. Syst. Sci., 2023

One Deterministic-Counter Automata.

Prince Mathew, Vincent Penelle, Prakash Saivasan, A. V. Sreejith

CoRR, 2023

Weighted One-Deterministic-Counter Automata.

Prince Mathew, Vincent Penelle, Prakash Saivasan, A. V. Sreejith

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2021

First-Order Logic and Its Infinitary Quantifier Extensions over Countable Words.

Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2020

Undecidability of a weak version of MSO+U.

Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith

Log. Methods Comput. Sci., 2020

2019

Block products for algebras over countable words and applications to logic.

Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018

Undecidability of MSO+"ultimately periodic".

Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith

CoRR, 2018

2017

Two-Variable First Order Logic with Counting Quantifiers: Complexity Results.

Kamal Lodaya, A. V. Sreejith

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

2016

Two-Variable Logic over Countable Linear Orderings.

Amaldev Manuel, A. V. Sreejith

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

Limited Set quantifiers over Countable Linear Orderings.

Thomas Colcombet, A. V. Sreejith

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains.

Vikraman Arvind, S. Raja, A. V. Sreejith

Proceedings of the Computer Science - Theory and Applications, 2014

2012

Non-definability of Languages by Generalized First-order Formulas over (N, +).

Andreas Krebs, A. V. Sreejith

Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2011

Expressive Completeness for LTL With Modulo Counting and Group Quantifiers.

A. V. Sreejith

Proceedings of the 7th Workshop on Methods for Modalities, 2011

2010

LTL Can Be More Succinct.

Kamal Lodaya, A. V. Sreejith

Proceedings of the Automated Technology for Verification and Analysis, 2010