1 citations · 1 across the 6 of their papers we have counts for
8 papers
Scalable Learning of One-Counter Automata via State-Merging Algorithms
Shibashis Guha, Anirban Majumdar, Prince Mathew +1
We propose One-counter Positive Negative Inference (OPNI), a passive learning algorithm for deterministic real-time one-counter automata (DROCA). Inspired by the RPNI algorithm for…
Learning Deterministic One-Counter Automata in Polynomial Time
Prince Mathew, Vincent Penelle, A. V. Sreejith
We give an active learning algorithm for deterministic one-counter automata (DOCAs) where the learner can ask the teacher membership and minimal equivalence queries. The algorithm…
Learning real-time one-counter automata using polynomially many queries
Prince Mathew, Vincent Penelle, A. V. Sreejith
In this paper, we introduce a novel method for active learning of deterministic real-time one-counter automata (DROCA). The existing techniques for learning DROCA rely on observing…
Weighted One-Deterministic-Counter Automata
Prince Mathew, Vincent Penelle, Prakash Saivasan +1
We introduce weighted one-deterministic-counter automata (ODCA). These are weighted one-counter automata (OCA) with the property of counter-determinacy, meaning that all paths labe…
First-Order logic and its Infinitary Quantifier Extensions over Countable Words
Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith
We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic cha…
Undecidability of a weak version of MSO+U
Mikołaj Bojańczyk, Laure Daviaud, Bruno Guillon +2
We prove the undecidability of MSO on -words extended with the second-order predicate which says that the distance between consecutive positions in a set $X \subseteq \…
Modulo quantifiers over functional vocabularies extending addition
A. Baskar, A. V. Sreejith, R. S. Thinniyam
We show that first order logic (FO) and first order logic extended with modulo counting quantifiers (FOMOD) over purely functional vocabularies which extend addition, satisfy the C…
Non-definability of languages by generalized first-order formulas over (N,+)
Andreas Krebs, A. V. Sreejith
We consider first-order logic with monoidal quantifiers over words. We show that all languages with a neutral letter, definable using the addition numerical predicate are also defi…