Complexity of problems concerning reset words for cyclic and Eulerian automata (Q442134): 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.2012.04.022
+Normal rank
@@ Property / OpenAlex ID @@
+W2175473110
@@ Property / OpenAlex ID: W2175473110 / rank @@
+Normal rank
@@ Property / cites work @@
+Synchronizing monotonic automata
@@ Property / cites work: Synchronizing monotonic automata / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the minimum length of synchronizing words is hard
+Normal rank
@@ Property / cites work @@
+Q5509690
@@ Property / cites work: Q5509690 / rank @@
+Normal rank
@@ Property / cites work @@
+Reset Sequences for Monotonic Automata
@@ Property / cites work: Reset Sequences for Monotonic Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Synchronizing finite automata on Eulerian digraphs.
+Normal rank
@@ Property / cites work @@
+Q5306174
@@ Property / cites work: Q5306174 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Finding Reset Words in Finite Automata
+Normal rank
@@ Property / cites work @@
+On two Combinatorial Problems Arising from Automata Theory
+Normal rank
@@ Property / cites work @@
+Composition sequences for functions over a finite domain.
+Normal rank
@@ Property / cites work @@
+Synchronizing automata preserving a chain of partial orders
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:442134