Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

DBPL
2005
Springer

favoriteEmaildiscussreport

93views Database» more DBPL 2005»

Minimizing Tree Automata for Unranked Trees

13 years 10 months ago

Minimizing Tree Automata for Unranked Trees

Download lrb.cs.uni-dortmund.de

Wim Martens, Joachim Niehren

Real-time Traffic

DBPL 2005 |

claim paper

Related Content

» On the minimization of XML Schemas and tree automata for unranked trees

» Deterministic Automata on Unranked Trees

» Weighted Logics for Unranked Tree Automata

» Querying Unranked Trees with Stepwise Tree Automata

» Logics for Unranked Trees An Overview

» On Nondeterministic Unranked Tree Automata with Sibling Constraints

» Languages Modulo Normalization

» Automata and Logics for Unranked and Unordered Trees

» Unranked Tree Automata with Sibling Equalities and Disequalities

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	DBPL
Authors	Wim Martens, Joachim Niehren

Comments (0)