On a class of languages recognizable by probabilistic reversible decide-and-halt automata (Q1017410): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2009.01.042
@@ Property / DOI: 10.1016/j.tcs.2009.01.042 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2009.01.042
+Normal rank
@@ Property / OpenAlex ID @@
+W2011107310
@@ Property / OpenAlex ID: W2011107310 / rank @@
+Normal rank
@@ Property / cites work @@
+STACS 2004
@@ Property / cites work: STACS 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2762497
@@ Property / cites work: Q2762497 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4452048
@@ Property / cites work: Q4452048 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of 1-Way Quantum Finite Automata
+Normal rank
@@ Property / cites work @@
+Q4808680
@@ Property / cites work: Q4808680 / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum automata and quantum grammars
@@ Property / cites work: Quantum automata and quantum grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic automata
@@ Property / cites work: Probabilistic automata / rank @@
+Normal rank
@@ Property / cites work @@
+Permutation automata
@@ Property / cites work: Permutation automata / rank @@
+Normal rank
@@ Property / cites work @@
+On stochastic languages
@@ Property / cites work: On stochastic languages / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2009.01.042
@@ Property / DOI: 10.1016/J.TCS.2009.01.042 / rank @@
+Normal rank