Recognition of directed acyclic graphs by spanning tree automata (Q1959657): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2010.06.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2038955206
@@ Property / OpenAlex ID: W2038955206 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata
+Normal rank
@@ Property / cites work @@
+Closure properties and decision problems of dag automata
+Normal rank
@@ Property / cites work @@
+The complexity of tree automata and XPath on grammar-compressed trees
+Normal rank
@@ Property / cites work @@
+Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar
+Normal rank
@@ Property / cites work @@
+Linear-time computability of combinatorial problems on series-parallel graphs
+Normal rank
@@ Property / cites work @@
+Combinatorial algorithms on a class of graphs
@@ Property / cites work: Combinatorial algorithms on a class of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Implementation and Application of Automata
@@ Property / cites work: Implementation and Application of Automata / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1959657