1 citations · 1 across the 7 of their papers we have counts for
9 papers
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…
Equivalence of Deterministic Weighted Real-time One-Counter Automata
Prince Mathew, Vincent Penelle, Prakash Saivasan +1
This paper introduces deterministic weighted real-time one-counter automaton (DWROCA). A DWROCA is a deterministic real-time one-counter automaton whose transitions are assigned a…
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…
On Synthesis of Resynchronizers for Transducers
Sougata Bose, Shankara Narayanan Krishna, Anca Muscholl +2
We study two formalisms that allow to compare transducers over words under origin semantics: rational and regular resynchronizers, and show that the former are captured by the latt…
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 \…