Some natural decision problems in automatic graphs (Q3570167): Difference between revisions

@@ Property / cites work @@
+LICS 2001 special issue
@@ Property / cites work: LICS 2001 special issue / rank @@
+Normal rank
@@ Property / cites work @@
+Taking it to the limit: On infinite variants of NP-complete problems
+Normal rank
@@ Property / cites work @@
+Hamiltonian paths in infinite graphs
@@ Property / cites work: Hamiltonian paths in infinite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+ÜBER Euler‐Linien Unendlicher Graphen
@@ Property / cites work: ÜBER Euler‐Linien Unendlicher Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994461
@@ Property / cites work: Q3994461 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite presentations of infinite structures: Automata and interpretations
+Normal rank
@@ Property / cites work @@
+Logical Reversibility of Computation
@@ Property / cites work: Logical Reversibility of Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Automata Presenting Structures: A Survey of the Finite String Case
+Normal rank
@@ Property / cites work @@
+Automatic graphs and D0L-sequences of finite graphs
+Normal rank
@@ Property / cites work @@
+Automatic linear orders and trees
@@ Property / cites work: Automatic linear orders and trees / rank @@
+Normal rank