The following pages link to Frédéric Servais (Q1672008):
Displaying 14 items.
- Visibly pushdown transducers (Q1672009) (← links)
- On the computation of the minimal coverability set of Petri nets (Q2330599) (← links)
- Visibly Pushdown Transducers with Look-Ahead (Q2891373) (← links)
- (Q2911634) (← links)
- Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning (Q3011882) (← links)
- Visibly Pushdown Transducers (Q3519516) (← links)
- Properties of Visibly Pushdown Transducers (Q3586097) (← links)
- Finite-State Map-Reduce Computation and Relational Algebra Queries (Q4581461) (← links)
- Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning (Q4914290) (← links)
- (Q4994131) (← links)
- From Two-Way to One-Way Finite State Transducers (Q5271084) (← links)
- (Q5376652) (← links)
- On the Symbolic Computation of the Hardest Configurations of the RUSH HOUR Game (Q5434468) (← links)
- (Q5738943) (← links)
