METHOD AND/OR SYSTEM FOR SIMPLIFYING TREE EXPRESSIONS, SUCH AS FOR PATTERN MATCHING
Embodiments of methods, apparatuses, devices and/or systems for simplifying tree expressions, such as for pattern matching, are disclosed.
1 - 10 . (canceled)
11 . A method for manipulating a complex two-dimensional graphical hierarchy for electronic processing and/or storage, the complex two-dimensional graphical hierarchy being in the form of a tree hierarchy, the method comprising:
accessing instructions from one or more physical memory devices for execution by one or more processors;
executing instructions accessed from the one or more physical memory devices by the one or more processors;
storing, in at least one of the one or more physical memory devices, signal values resulting from having executed the instructions on the one or more processors;
wherein the accessed instructions comprise instructions for manipulating the tree hierarchy; and
wherein executing the accessed tree hierarchy manipulation instructions further comprise:
applying manipulations to reduce a tree expression to one or more interrelated queries.
12 . The method of claim 11 , and further comprising: applying the one or more interrelated queries to produce one or more conditions that make the tree expression true.
13 . The method of claim 11 , wherein the tree expression comprises an expression in ordered trees.
14 . The method of claim 13 , wherein the tree expression comprises an expression in ordered binary edge labeled trees.
15 . The method of claim 11 , wherein the tree expression comprises an expression in unordered trees.
16 . The method of claim 15 , wherein the tree expression comprises an expression in unordered binary edge labeled trees.
17 . The method of claim 11 , wherein the manipulations comprise algebraic manipulations.
18 . The method of claim 17 , wherein the algebraic manipulations are derived at least in part from eight or more basis expressions.
19 . The method of claim 17 , wherein the algebraic manipulations are derived at least in part from eight or more basis expressions.
20 . The method of claim 17 , wherein the algebraic manipulations comprise a set of tree reducing expressions.
21 . The method of claim 11 , wherein the tree expression comprises a tree equation.
22 . The method of claim 11 , wherein the one or more interrelated queries comprise one or more queries interrelated by Boolean operators.
23 . The method of claim 11 , wherein applying manipulations comprises applying eight or more basis expressions and then applying a set of tree reducing expressions derived from the basis expressions.
24 . The method of claim 23 , wherein the set of tree reducing expressions comprises at least 47 expressions.
25 - 53 . (canceled)
54 . An article comprising:
a non-transitory storage medium comprising instructions stored thereon, wherein the instructions being accessible from the non-transitory storage medium to store as physical memory states on one or more physical memory devices, the one or more physical memory devices coupled to one or more processors able to execute the instructions stored as physical memory states, the one or more physical memory devices also able to store binary digital signals quantities, if any, as physical memory states, that are to result from execution of the instructions on the one or more processors,
wherein the executable instructions to manipulate a complex two-dimensional tree hierarchy; and
wherein executing the complex two-dimensional graphical tree hierarchy manipulation instructions further to:
determine one or more conditions which make an expression in unordered trees true or false by reducing the unordered tree expression to one or more queries.
55 . The article of claim 54 , wherein the one or more queries comprise interrelated queries.
56 . The article of claim 55 , wherein the interrelated queries comprise queries interrelated by Boolean operators.
57 . The article of claim 54 , wherein
to reduce the unordered tree expression comprises manipulating the tree expression.
58 . The article of claim 57 , wherein the manipulations comprise algebraic manipulations.
59 . The article of claim 58 , wherein executing the complex two-dimensional graphical tree hierarchy manipulation instructions further to implement the algebraic manipulations using a table look-up approach at least in part.
60 . The article of claim 58 , wherein the algebraic manipulations are based at least in part on a set of basis expressions.
61 - 70 . (canceled)
71 . An apparatus to manipulate a complex two-dimensional graphical hierarchy for electronic processing and/or storage, the complex two-dimensional graphical hierarchy being in the form of a tree hierarchy, the apparatus comprising:
means for accessing instructions from one or more physical memory devices for execution by one or more processors;
means for executing instructions accessed from the one or more physical memory devices by the one or more processors;
means for storing, in the at least one of the one or more physical memory devices, signal values resulting from having executed the instructions on the one or more processors;
wherein the accessed instructions comprise instructions for manipulating the tree hierarchy; and
wherein the means for executing the accessed tree hierarchy manipulation instructions comprises:
means for applying manipulations to reduce a tree expression to one or more interrelated queries; and
means for displaying the one or more interrelated queries.
72 . The apparatus of claim 71 , wherein the means for applying manipulations to reduce the tree expression to one or more interrelated queries comprises means for applying the one or more interrelated queries to produce one or more conditions that make the tree expression true.
73 . The apparatus of claim 71 , wherein the means for applying manipulations to reduce the tree expression to one or more interrelated queries includes the tree expression comprising an expression in ordered trees.
74 . The apparatus of claim 73 , wherein the means for applying manipulations to reduce the tree expression to one or more interrelated queries includes the tree expression comprising an expression in ordered binary edge labeled trees.
75 . The apparatus of claim 71 , wherein the means for applying manipulations to reduce the tree expression to one or more interrelated queries includes the tree expression comprising an expression in unordered trees.
76 . The apparatus of claim 75 , wherein the means for applying manipulations to reduce the tree expression to one or more interrelated queries includes the tree expression comprising an expression in unordered binary edge labeled trees.
77 . The apparatus of claim 71 , wherein the means for applying manipulations to reduce the tree expression to one or more interrelated queries includes the manipulations comprising algebraic manipulations.
78 . The apparatus of claim 77 , wherein the means for applying manipulations to reduce the tree expression to one or more interrelated queries includes the algebraic manipulations being derived at least in part from eight or more basis expressions.
79 . The apparatus of claim 78 , wherein the means for applying manipulations to reduce the tree expression to one or more interrelated queries includes the eight or more basis expressions being derived at least in part from nine basis expressions.
80 . The apparatus of claim 79 , wherein the means for applying manipulations to reduce the tree expression to one or more interrelated queries includes the algebraic manipulations comprising a set of tree reducing expressions.
81 . The apparatus of claim 71 , wherein the means for applying manipulations to reduce the tree expression to one or more interrelated queries includes the tree expression comprising a tree equation.
82 . The apparatus of claim 71 , wherein the means for applying manipulations to reduce the tree expression to one or more interrelated queries includes the one or more interrelated queries comprising one or more interrelated by Boolean operators.
83 . The apparatus of claim 71 , wherein the means for applying manipulations comprises means for applying eight or more basis expressions and later applying a set of tree reducing expressions derived from the eight or more basis expressions
84 - 125 . (canceled)