Finite state complexity (Q719308): 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.2011.06.021
+Normal rank
@@ Property / OpenAlex ID @@
+W2083810917
@@ Property / OpenAlex ID: W2083810917 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57001526
@@ Property / Wikidata QID: Q57001526 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5653940
@@ Property / cites work: Q5653940 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight lower bounds on the length of word chains
@@ Property / cites work: Tight lower bounds on the length of word chains / rank @@
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Models of Computation
@@ Property / cites work: Theory and Applications of Models of Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q3859267
@@ Property / cites work: Q3859267 / rank @@
+Normal rank
@@ Property / cites work @@
+Entropy rates and finite-state dimension
@@ Property / cites work: Entropy rates and finite-state dimension / rank @@
+Normal rank
@@ Property / cites work @@
+Resource-bounded kolmogorov complexity revisited
@@ Property / cites work: Resource-bounded kolmogorov complexity revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Q4806962
@@ Property / cites work: Q4806962 / rank @@
+Normal rank
@@ Property / cites work @@
+Representation of left-computable \(\varepsilon \)-random reals
+Normal rank
@@ Property / cites work @@
+Algorithmic Information Theory
@@ Property / cites work: Algorithmic Information Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the smallest grammar
@@ Property / cites work: Approximating the smallest grammar / rank @@
+Normal rank
@@ Property / cites work @@
+Q5834367
@@ Property / cites work: Q5834367 / rank @@
+Normal rank
@@ Property / cites work @@
+Simulating finite automata with context-free grammars.
+Normal rank
@@ Property / cites work @@
+Feasible Depth
@@ Property / cites work: Feasible Depth / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Randomness and Complexity
@@ Property / cites work: Algorithmic Randomness and Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828933
@@ Property / cites work: Q4828933 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3611832
@@ Property / cites work: Q3611832 / rank @@
+Normal rank
@@ Property / cites work @@
+Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
+Normal rank
@@ Property / cites work @@
+Endliche Automaten und Zufallsfolgen
@@ Property / cites work: Endliche Automaten und Zufallsfolgen / rank @@
+Normal rank
@@ Property / cites work @@
+Q3392273
@@ Property / cites work: Q3392273 / rank @@
+Normal rank
@@ Property / cites work @@
+Automaticity. I: Properties of a measure of descriptional complexity
+Normal rank
@@ Property / cites work @@
+Q4531381
@@ Property / cites work: Q4531381 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4002255
@@ Property / cites work: Q4002255 / rank @@
+Normal rank
@@ Property / cites work @@
+Compression of individual sequences via variable-rate coding
+Normal rank