1738 2005-07-18 22:24:25 +0000 [FS] what is "one-determinism"? 2005-09-06 13:14:12 +0000 1 1 1 Unclassified XPath / XQuery / XSLT Formal Semantics 1.0 Last Call drafts PC Windows 2000 CLOSED FIXED P2 normal --- 1 fred.zemke simeon public-qt-comments oldest_to_newest 4850 0 fred.zemke 2005-07-18 22:24:25 +0000 8.1.10 Union interpretation of derived types This section uses the undefined term "one-determinism". I see how (element a | element a, element b) is naturally recognized by a non-deterministic finite state automoton, and it is equivalent to (element a, (() | element b)), which is naturally recognized by a deterministic finite state automoton, so I think I see a way to define "one-determinism". Probably the term is understood in some communities, but I think it would be better to reformulate this in a more commonly known vocabulary. In addition, the conversion of non-deterministic FSA to deterministic is well documented, and probably found in the references you cite in 8.3.2 "Subtype and type equality", so this looks like a good path to take. 4968 1 pcotton 2005-07-20 00:57:11 +0000 The WGs agreed to use the correct XML Schema WG terminology for this situation which is "UPA". We agreee to change "that enforces the one-determinism property" with "that enforces the UPA property". Please let us know if you are not satisifed with this resolution. Paul Cotton On behalf of XML Query and XSL WGs