Reducing the time complexity of testing for local threshold testability (Q703505): Difference between revisions

@@ Property / cites work @@
+Characterizations of locally testable events
@@ Property / cites work: Characterizations of locally testable events / rank @@
+Normal rank
@@ Property / cites work @@
+Families of locally testable languages
@@ Property / cites work: Families of locally testable languages / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Order of a Locally Testable Automaton
+Normal rank
@@ Property / cites work @@
+A polynomial time algorithm for the local testability problem of deterministic finite automata
+Normal rank
@@ Property / cites work @@
+Q5641083
@@ Property / cites work: Q5641083 / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Graph congruences and wreath products
@@ Property / cites work: Graph congruences and wreath products / rank @@
+Normal rank
@@ Property / cites work @@
+A POLYNOMIAL TIME ALGORITHM FOR LOCAL TESTABILITY AND ITS LEVEL
+Normal rank
@@ Property / cites work @@
+Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order
+Normal rank
@@ Property / cites work @@
+Q4782722
@@ Property / cites work: Q4782722 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4418616
@@ Property / cites work: Q4418616 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281563
@@ Property / cites work: Q4281563 / rank @@
+Normal rank
@@ Property / cites work @@
+AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
+Normal rank