1 citations · 1 across the 4 of their papers we have counts for
7 papers · 1 filter
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…
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…
Origin-equivalence of two-way word transducers is in PSPACE
Sougata Bose, Anca Muscholl, Vincent Penelle +1
We consider equivalence and containment problems for word transductions. These problems are known to be undecidable when the transductions are relations between words realized by n…
Annotated Stack Trees
Matthew Hague, Vincent Penelle
Annotated pushdown automata provide an automaton model of higher-order recursion schemes, which may in turn be used to model higher-order programs for the purposes of verification.…