Synthesizing structured reactive programs via deterministic tree automata (Q2346409): Difference between revisions

@@ Property / cites work @@
+Solving Sequential Conditions by Finite-State Strategies
+Normal rank
@@ Property / cites work @@
+Q4074888
@@ Property / cites work: Q4074888 / rank @@
+Normal rank
@@ Property / cites work @@
+Church's Problem Revisited
@@ Property / cites work: Church's Problem Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded Synthesis
@@ Property / cites work: Bounded Synthesis / rank @@
+Normal rank
@@ Property / cites work @@
+Q2915700
@@ Property / cites work: Q2915700 / rank @@
+Normal rank
@@ Property / cites work @@
+Synthesis from Component Libraries
@@ Property / cites work: Synthesis from Component Libraries / rank @@
+Normal rank
@@ Property / cites work @@
+Degrees of Lookahead in Regular Infinite Games
@@ Property / cites work: Degrees of Lookahead in Regular Infinite Games / rank @@
+Normal rank
@@ Property / cites work @@
+Strategy Machines and Their Complexity
@@ Property / cites work: Strategy Machines and Their Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph searching and a min-max theorem for tree-width
+Normal rank
@@ Property / cites work @@
+The treewidth and pathwidth of hypercubes
@@ Property / cites work: The treewidth and pathwidth of hypercubes / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+All structured programs have small tree width and good register allocation
+Normal rank