Please use this identifier to cite or link to this item:
Title: Deterministic top-down tree automata: past, present, future
Authors: MARTENS, Wim 
NEVEN, Frank 
Schwentick, Thomas
Issue Date: 2007
Publisher: Amsterdam University Press
Source: Flum, J & Graedel, E & Wilke, Th (Ed.) Logic and automata : History and perspectives, p. 505-530.
Series/Report: Texts in Logic and Games
Series/Report no.: 2
Abstract: In strong contrast to their non-deterministic counterparts, deterministic top-down tree automata received little attention in the scientific literature. The aim of this article is to survey recent and less recent results and stipulate new research directions for top-down deterministic tree automata motivated by the advent of the XML data exchange format. In particular, we survey different ranke and unranked top-down tree automata models and discuss expressiveness, closure properties and the complexity of static analysis problems.
Document URI:
Link to publication:
ISBN: 978 90 5356 576 6
Category: B2
Type: Book Section
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
deterministic.pdf240.56 kBAdobe PDFView/Open
Show full item record

Page view(s)

checked on Feb 24, 2022


checked on Feb 24, 2022

Google ScholarTM



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