Reader in1 = new StringReader("f(x,y)"); // Use FileReader instead Reader in2 = new StringReader("f(y,x)"); // Use FileReader instead int maxReduce = 100; Set<Variable> dom = DataStructureFactory.$.newSet(); dom.add(new Variable("x", null)); dom.add(new Variable("y", null)); Set<Variable> ran = DataStructureFactory.$.newSet(); ran.add(new Variable("x", null)); ran.add(new Variable("y", null)); EquationSystem<PermEquivProblem> eqSys = new EquationSystem<PermEquivProblem>() { public PermEquivProblem newEquation() { return new PermEquivProblem(); } }; new InputParser().parseEquation(in1, in2, eqSys, maxReduce); Map<Variable, Variable> permutation = new PermEquiv(eqSys, dom, ran) .compute(DebugLevel.SILENT, null); System.out.println(permutation);
Author: | Alexander Baumgartner | |
Project: | SToUT - Symbolic Computation Techniques for Unranked Terms |