Advanced search    

Search: authors:"Sylvain Salvati"

4 papers found.
Use AND, OR, NOT, +word, -word, "long phrase", (parentheses) to fine-tune your search.

On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems

Karp and Miller's algorithm is a well-known decision procedure that solves the termination and boundedness problems for vector addition systems with states (VASS), or equivalently Petri nets. This procedure was later extended to a general class of models, well-structured transition systems, and, more recently, to pushdown VASS. In this paper, we extend pushdown VASS to higher...

On the Decomposition of Finite-Valued Streaming String Transducers

We prove the following decomposition theorem: every 1-register streaming string transducer that associates a uniformly bounded number of outputs with each input can be effectively decomposed as a finite union of functional 1-register streaming string transducers. This theorem relies on a combinatorial result by Kortelainen concerning word equations with iterated factors. Our...

Ordered Tree-Pushdown Systems

We define a new class of pushdown systems where the pushdown is a tree instead of a word. We allow a limited form of lookahead on the pushdown conforming to a certain ordering restriction, and we show that the resulting class enjoys a decidable reachability problem. This follows from a preservation of recognizability result for the backward reachability relation of such systems...

Evaluation is MSOL-compatible

://hal.inria.fr/hal-00773126. Sylvain Salvati . Recognizability in the simply typed lambda-calculus . In WoLLIC , volume 5514 of LNCS , pages 48 - 60 , 2009 . Manfred Schmidt-Schau? . Decidability of arity-bounded