Complexity of EOL structural equivalence (Q5096917): Difference between revisions

@@ Property / cites work @@
+Q4039803
@@ Property / cites work: Q4039803 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3975141
@@ Property / cites work: Q3975141 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3323279
@@ Property / cites work: Q3323279 / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of synchronization in parallel computations
+Normal rank
@@ Property / cites work @@
+Complexity of some problems concerningL systems
@@ Property / cites work: Complexity of some problems concerningL systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036765
@@ Property / cites work: Q4036765 / rank @@
+Normal rank
@@ Property / cites work @@
+Parenthesis Grammars
@@ Property / cites work: Parenthesis Grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036763
@@ Property / cites work: Q4036763 / rank @@
+Normal rank
@@ Property / cites work @@
+Defining families of trees with E0L grammars
@@ Property / cites work: Defining families of trees with E0L grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036764
@@ Property / cites work: Q4036764 / rank @@
+Normal rank
@@ Property / cites work @@
+Structural equivalence of context-free grammars
@@ Property / cites work: Structural equivalence of context-free grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Q4746787
@@ Property / cites work: Q4746787 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of structural equivalence of E0L grammars
+Normal rank
@@ Property / cites work @@
+Q4284264
@@ Property / cites work: Q4284264 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding Equivalence of Finite Tree Automata
@@ Property / cites work: Deciding Equivalence of Finite Tree Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Communication for alternating machines
@@ Property / cites work: Communication for alternating machines / rank @@
+Normal rank
@@ Property / cites work @@
+The membership question for ETOL-languages is polynomially complete
+Normal rank
@@ Property / cites work @@
+The tape-complexity of context-independent developmental languages
+Normal rank
@@ Property / cites work @@
+Q3031934
@@ Property / cites work: Q3031934 / rank @@
+Normal rank