Search Sciweavers | Sciweavers

254 search results - page 24 / 51

» Restarting Tree Automata

click to vote

RTA
2005
Springer

197views Theoretical Computer Science» more RTA 2005»

On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems

14 years 2 months ago

Download www.imn.htwk-leipzig.de

We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...

Alfons Geser, Dieter Hofbauer, Johannes Waldmann, ...

claim paper

Read More »

click to vote

PODS
2004
ACM

95views Database» more PODS 2004»

Trees, Automata and XML

14 years 9 months ago

Download lrb.cs.uni-dortmund.de

Thomas Schwentick

claim paper

Read More »

click to vote

ICALP
2007
Springer

97views Programming Languages» more ICALP 2007»

Unranked Tree Automata with Sibling Equalities and Disequalities

14 years 3 months ago

Download www-i7.informatik.rwth-aachen.de

Karianto Wong, Christof Löding

claim paper

Read More »

click to vote

WIA
2007
Springer

129views Artificial Intelligence» more WIA 2007»

An Implementation of Deterministic Tree Automata Minimization

14 years 2 months ago

Download www.dlsi.ua.es

Rafael C. Carrasco, Jan Daciuk, Mikel L. Forcada

claim paper

Read More »

click to vote

ATVA
2005
Springer

93views Hardware» more ATVA 2005»

A Static Analysis Using Tree Automata for XML Access Control

14 years 2 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers