Using Finite State Automata to Implement W3C XML Schema Content Model Validation and Restriction Checking. Thompson, H. S. and Tobin, R. In
abstract   bibtex   
Implementing validation and restriction checking for W3C XML Schema content models is harder than for DTDs. This paper gives complete details on how to convert W3C XML Schema content models to Finite State Automata, including handling of numeric exponents and wildcards. Enforcing the Unique Particle Attribution constraint and implementing restriction checking in polynomial time using these FSAs is also described.
@inproceedings{ tho03,
  crossref = {xmleu2003},
  author = {Henry S. Thompson and Richard Tobin},
  title = {Using Finite State Automata to Implement W3C XML Schema Content Model Validation and Restriction Checking},
  uri = {http://www.idealliance.org/papers/dx_xmle03/index/title/06f9fe54d6aafaa358188c385b.html},
  topic = {xsd[0.8]},
  abstract = {Implementing validation and restriction checking for W3C XML Schema content models is harder than for DTDs. This paper gives complete details on how to convert W3C XML Schema content models to Finite State Automata, including handling of numeric exponents and wildcards. Enforcing the Unique Particle Attribution constraint and implementing restriction checking in polynomial time using these FSAs is also described.}
}
Downloads: 0