1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.FL2019★ 1 cited
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…
cs.FL2015
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.…
cs.FL2015
Rewriting Higher-Order Stack Trees
Vincent Penelle
Higher-order pushdown systems and ground tree rewriting systems can be seen as extensions of suffix word rewriting systems. Both classes generate infinite graphs with interesting l…