Sciweavers

16 search results - page 1 / 4

» rta 2009

23

RTA
2009
Springer

93views Theoretical Computer Science» more RTA 2009»

Modularity of Convergence in Infinitary Rewriting

14 years 3 months ago

Modularity of Convergence in Infinitary Rewriting

Download www.cs.kent.ac.uk

Stefan Kahrs

claim paper

Read More »

21

RTA
2009
Springer

120views Theoretical Computer Science» more RTA 2009»

Automatic Termination

14 years 1 months ago

Automatic Termination

Download www.imn.htwk-leipzig.de

Johannes Waldmann

claim paper

Read More »

25

RTA
2009
Springer

87views Theoretical Computer Science» more RTA 2009»

Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case

14 years 1 months ago

Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case

Download www2.in.tum.de

Helmut Seidl, Kumar Neeraj Verma

claim paper

Read More »

24

RTA
2009
Springer

86views Theoretical Computer Science» more RTA 2009»

Proving Termination of Integer Term Rewriting

14 years 3 months ago

Proving Termination of Integer Term Rewriting

Download verify.rwth-aachen.de

Carsten Fuhs, Jürgen Giesl, Martin Plück...

claim paper

Read More »

29

LATA
2009
Springer

115views Artificial Intelligence» more LATA 2009»

Rigid Tree Automata

14 years 3 months ago

Rigid Tree Automata

Download www.lsv.ens-cachan.fr

We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states deﬁne a rest...

Florent Jacquemard, Francis Klay, Camille Vacher

claim paper

Read More »

« Prev « First page 1 / 4 Last » Next »