On path equivalence of nondeterministic finite automata (Q1351166): 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/0020-0190(96)00039-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2012572971
@@ Property / OpenAlex ID: W2012572971 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel computation for well-endowed rings and space-bounded probabilistic machines
+Normal rank
@@ Property / cites work @@
+A taxonomy of problems with fast parallel algorithms
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3742714
@@ Property / cites work: Q3742714 / rank @@
+Normal rank
@@ Property / cites work @@
+Space-bounded reducibility among combinatorial problems
+Normal rank
@@ Property / cites work @@
+Q5606985
@@ Property / cites work: Q5606985 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992568
@@ Property / cites work: Q3992568 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5643915
@@ Property / cites work: Q5643915 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
+Normal rank