- From: <bugzilla@wiggum.w3.org>
- Date: Mon, 18 Jul 2005 22:24:26 +0000
- To: public-qt-comments@w3.org
- Cc:
http://www.w3.org/Bugs/Public/show_bug.cgi?id=1738
Summary: [FS] what is "one-determinism"?
Product: XPath / XQuery / XSLT
Version: Last Call drafts
Platform: PC
OS/Version: Windows 2000
Status: NEW
Severity: normal
Priority: P2
Component: Formal Semantics
AssignedTo: simeon@us.ibm.com
ReportedBy: fred.zemke@oracle.com
QAContact: public-qt-comments@w3.org
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.
Received on Monday, 18 July 2005 22:24:28 UTC