Counting with Probabilistic and Ultrametric Finite Automata (Q2944874): Difference between revisions

@@ Property / cites work @@
+Q4888749
@@ Property / cites work: Q4888749 / rank @@
+Normal rank
@@ Property / cites work @@
+One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata
+Normal rank
@@ Property / cites work @@
+Two-way automata and length-preserving homomorphisms
+Normal rank
@@ Property / cites work @@
+A \(p\)-adic model of DNA sequence and genetic code
+Normal rank
@@ Property / cites work @@
+Q3947125
@@ Property / cites work: Q3947125 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Ultrametric Analysis and Interbasin Kinetics
@@ Property / cites work: Ultrametric Analysis and Interbasin Kinetics / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct representation of regular languages by Boolean automata
+Normal rank
@@ Property / cites work @@
+Probabilistic automata
@@ Property / cites work: Probabilistic automata / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized Automata and Stochastic Languages
@@ Property / cites work: Generalized Automata and Stochastic Languages / rank @@
+Normal rank