www.uhasselt.be
DSpace

Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/961

Title: Minimizing Tree Automata for Unranked Trees
Authors: MARTENS, Wim
Niehren, J.
Issue Date: 2005
Publisher: Springer
Citation: DATABASE PROGRAMMING LANGUAGES. p. 232-246
Series/Report: LECTURE NOTES IN COMPUTER SCIENCE, 3774
Abstract: Automata for unranked trees form a foundation for XML schemas, querying and pattern languages. We study the problem of efficiently minimizing such automata. We start with the unranked tree automata (UTAs) that are standard in database theory, assuming bottom-up determinism and that horizontal recursion is represented by deterministic finite automata. We show that minimal UTAs in that class are not unique and that minimization is np-hard. We then study more recent automata classes that do allow for polynomial time minimization. Among those, we show that bottom-up deterministic stepwise tree automata yield the most succinct representations.
URI: http://hdl.handle.net/1942/961
DOI: 10.1007/11601524_15
ISI #: 000235803000015
ISBN: 3-540-30951-9
ISSN: 0302-9743
Category: A1
Type: Journal Contribution
Validation: ecoom, 2007
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
N/A480.12 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.