{"title":"有限状态相对维度、A. P. 子序列维度和有限状态范兰巴根定理","authors":"Satyadev Nandakumar, Subin Pulari, Akhil S","doi":"10.1016/j.ic.2024.105156","DOIUrl":null,"url":null,"abstract":"<div><p>Finite-state dimension, introduced by Dai, Lathrop, Lutz and Mayordomo quantifies the information rate in an infinite sequence as measured by finite-state automata. In this paper, we define a relative version of finite-state dimension. The finite-state relative dimension <span><math><msubsup><mrow><mi>dim</mi></mrow><mrow><mi>F</mi><mi>S</mi></mrow><mrow><mi>Y</mi></mrow></msubsup><mo>(</mo><mi>X</mi><mo>)</mo></math></span> of a sequence <em>X</em> relative to <em>Y</em> is the finite-state dimension of <em>X</em> measured using the class of finite-state gamblers with oracle access to <em>Y</em>. We show its mathematical robustness by equivalently characterizing this notion using the relative block entropy rate of <em>X</em> conditioned on <em>Y</em>.</p><p>We derive inequalities relating the dimension of a sequence to the relative dimension of its subsequences along any arithmetic progression (A. P.). These enable us to obtain a strengthening of Wall's Theorem on the normality of A. P. subsequences of a normal sequence, in terms of relative dimension. In contrast to the original theorem, this stronger version has an exact converse yielding a new characterization of normality.</p><p>We also obtain finite-state analogues of van Lambalgen's theorem on the symmetry of relative normality.</p></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"298 ","pages":"Article 105156"},"PeriodicalIF":0.8000,"publicationDate":"2024-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Finite-state relative dimension, dimensions of A. P. subsequences and a finite-state van Lambalgen's theorem\",\"authors\":\"Satyadev Nandakumar, Subin Pulari, Akhil S\",\"doi\":\"10.1016/j.ic.2024.105156\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Finite-state dimension, introduced by Dai, Lathrop, Lutz and Mayordomo quantifies the information rate in an infinite sequence as measured by finite-state automata. In this paper, we define a relative version of finite-state dimension. The finite-state relative dimension <span><math><msubsup><mrow><mi>dim</mi></mrow><mrow><mi>F</mi><mi>S</mi></mrow><mrow><mi>Y</mi></mrow></msubsup><mo>(</mo><mi>X</mi><mo>)</mo></math></span> of a sequence <em>X</em> relative to <em>Y</em> is the finite-state dimension of <em>X</em> measured using the class of finite-state gamblers with oracle access to <em>Y</em>. We show its mathematical robustness by equivalently characterizing this notion using the relative block entropy rate of <em>X</em> conditioned on <em>Y</em>.</p><p>We derive inequalities relating the dimension of a sequence to the relative dimension of its subsequences along any arithmetic progression (A. P.). These enable us to obtain a strengthening of Wall's Theorem on the normality of A. P. subsequences of a normal sequence, in terms of relative dimension. In contrast to the original theorem, this stronger version has an exact converse yielding a new characterization of normality.</p><p>We also obtain finite-state analogues of van Lambalgen's theorem on the symmetry of relative normality.</p></div>\",\"PeriodicalId\":54985,\"journal\":{\"name\":\"Information and Computation\",\"volume\":\"298 \",\"pages\":\"Article 105156\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2024-03-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information and Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S089054012400021X\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information and Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S089054012400021X","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Finite-state relative dimension, dimensions of A. P. subsequences and a finite-state van Lambalgen's theorem
Finite-state dimension, introduced by Dai, Lathrop, Lutz and Mayordomo quantifies the information rate in an infinite sequence as measured by finite-state automata. In this paper, we define a relative version of finite-state dimension. The finite-state relative dimension of a sequence X relative to Y is the finite-state dimension of X measured using the class of finite-state gamblers with oracle access to Y. We show its mathematical robustness by equivalently characterizing this notion using the relative block entropy rate of X conditioned on Y.
We derive inequalities relating the dimension of a sequence to the relative dimension of its subsequences along any arithmetic progression (A. P.). These enable us to obtain a strengthening of Wall's Theorem on the normality of A. P. subsequences of a normal sequence, in terms of relative dimension. In contrast to the original theorem, this stronger version has an exact converse yielding a new characterization of normality.
We also obtain finite-state analogues of van Lambalgen's theorem on the symmetry of relative normality.
期刊介绍:
Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as
-Biological computation and computational biology-
Computational complexity-
Computer theorem-proving-
Concurrency and distributed process theory-
Cryptographic theory-
Data base theory-
Decision problems in logic-
Design and analysis of algorithms-
Discrete optimization and mathematical programming-
Inductive inference and learning theory-
Logic & constraint programming-
Program verification & model checking-
Probabilistic & Quantum computation-
Semantics of programming languages-
Symbolic computation, lambda calculus, and rewriting systems-
Types and typechecking