Automaticity. II: Descriptional complexity in the unary case (Q1390867): Difference between revisions

@@ Property / author @@
-Carl B. Pomerance
@@ Property / author: Carl B. Pomerance / rank @@
-Normal rank
@@ Property / author @@
-Jeffrey O. Shallit
@@ Property / author: Jeffrey O. Shallit / rank @@
-Normal rank
@@ Property / author @@
+Carl B. Pomerance
@@ Property / author: Carl B. Pomerance / rank @@
+Normal rank
@@ Property / author @@
+Jeffrey O. Shallit
@@ Property / author: Jeffrey O. Shallit / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of cycles possible in digraphs with large girth
+Normal rank
@@ Property / cites work @@
+Q4867898
@@ Property / cites work: Q4867898 / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit Bounds for Primality Testing and Related Problems
+Normal rank
@@ Property / cites work @@
+Statistical Evidence for Small Generating Sets
@@ Property / cites work: Statistical Evidence for Small Generating Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q3718171
@@ Property / cites work: Q3718171 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite automata and unary languages
@@ Property / cites work: Finite automata and unary languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4841794
@@ Property / cites work: Q4841794 / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of finite automata with both nondeterministic and probabilistic states (preliminary version)
+Normal rank
@@ Property / cites work @@
+Q3042404
@@ Property / cites work: Q3042404 / rank @@
+Normal rank
@@ Property / cites work @@
+A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
+Normal rank
@@ Property / cites work @@
+Q3241504
@@ Property / cites work: Q3241504 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4375814
@@ Property / cites work: Q4375814 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3976039
@@ Property / cites work: Q3976039 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036562
@@ Property / cites work: Q4036562 / rank @@
+Normal rank
@@ Property / cites work @@
+On cube-free \(\omega\)-words generated by binary morphisms
+Normal rank
@@ Property / cites work @@
+Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+On independent circuits of a digraph
@@ Property / cites work: On independent circuits of a digraph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5815665
@@ Property / cites work: Q5815665 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5339300
@@ Property / cites work: Q5339300 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5586371
@@ Property / cites work: Q5586371 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5540451
@@ Property / cites work: Q5540451 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3338346
@@ Property / cites work: Q3338346 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate formulas for some functions of prime numbers
+Normal rank
@@ Property / cites work @@
+Automaticity. I: Properties of a measure of descriptional complexity
+Normal rank
@@ Property / cites work @@
+On digraphs with no two disjoint directed cycles
@@ Property / cites work: On digraphs with no two disjoint directed cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Q4325957
@@ Property / cites work: Q4325957 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5665234
@@ Property / cites work: Q5665234 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1390867