Wim Martens, Frank Neven, Thomas Schwentick  Home/Search
Context
Related
| alpha.luc.ac.be/~fneven/icdt05.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: alpha.luc.ac.be/~fneven/publs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: It is shown that the class of regular tree languages admitting one-pass preorder typing is exactly the class de ned by restrained competition tree grammars introduced by Murata et al. [14]. In a streaming context, the former is the largest class of XSDs where every element in a document can be typed when its opening tag is met. The main technical machinery consists of semantical characterizations of restrained competition grammars and their subclasses. In particular, they can be... (Update)
Active bibliography (related documents): More All
0.6: A System for the Static Analysis of XPath - Geneves, Layaida (2006) (Correct)
0.5: Regularity Problems for Visibly Pushdown - Languages Vince Barany (Correct)
0.5: Preserving Constraints for Aggregation Relationship Type - Update In Xml (2004) (Correct)
Similar documents based on text: More All
0.5: Typechecking Top-Down Uniform Unranked Tree Transducers - Martens, Neven (Correct)
0.4: Query Automata (Extended Abstract) - Neven, Schwentick (Correct)
0.4: A Formal Model for an Expressive Fragment of XSLT - Bex, Maneth, Neven (2000) (Correct)
BibTeX entry: (Update)
@misc{ martens-which,
author = "Wim Martens and Frank Neven and Thomas Schwentick",
title = "Which XML Schemas Admit 1-Pass Preorder Typing?",
url = "citeseer.ist.psu.edu/721405.html" }
Citations (may not include all citations):53 DTD inference for views of XML data - Papakonstantinou, Vianu - 2000
40 Taxonomy of XML schema languages using formal language theor.. - Murata, Lee et al. - 2001
39 Word problems requiring exponential time: Preliminary report (context) - Stockmeyer, Meyer - 1973
23 XDuce: A statically typed XML processing language - Hosoya, Pierce - 2003
11 Typechecking top-down uniform unranked tree transducers - Martens, Neven - 2003
11 and XML (context) - Neven, logic - 2002
10 One-unambiguous regular languages - Br, Wood - 1998
8 Deciding equivalence of nite tree automata (context) - Seidl - 1990
6 Typechecking for semistructured data - Suciu - 2001
5 Incremental validation of XML documents (context) - Papakonstantinou, Vianu - 2003
2 Visibly pushdown languages - Alur, Madhusudan - 2004
2 Regular tree and regular hedge languages over unranked alpha.. - Br, Murata et al. - 2001
2 Frontiers of tractability for typechecking simple XML transf.. (context) - Martens, Neven - 2004
2 Validating streaming XML documents (context) - Segou, Vianu - 2002
2 XML Schema (context) - van der Vlist - 2002
2 Attribute grammars for scalable query processing on XML stre.. - Koch, Scherzinger - 2003
1 Keeping chess alive - Do we need 1-unambiguous content model.. (context) - Mani - 2001
1 Complexity of decision problems for simple regular expressio.. (context) - Martens, Neven et al. - 2004
1 A language for document grammars (context) - Sperberg-McQueen - 2003
http://www.w3.org/TR/xmlschema-1/
http://www.w3.org/TR/xmlschema-0/
http://www.w3.org/XML/Schema
http://www.w3.org/XML
Documents on the same site (http://alpha.luc.ac.be/~fneven/publs.html): More
A Formal Model for an Expressive Fragment of XSLT - Bex, Maneth, Neven (2000) (Correct)
Expressive Power of XSLT - Bex, Maneth, Neven (2000) (Correct)
On the Power of Tree-Walking Automata - Neven, Schwentick (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC