•Given alphabet S
•
•A DTD is a set of expressions:
s := E where E is a “regular
expression”
•
•Example:
root := person*
person :=
name,project?,email*,(address|contact)
project :=
name, project*
•A tree T satisfies the DTD iff it is a derivation tree