Degrees of Streams
暂无分享,去创建一个
[1] Frits Dannenberg,et al. Symbolic dynamics and automata theory , 2011 .
[2] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.
[3] Manuel Lerman,et al. Degrees of Unsolvability: Local and Global Theory , 1983 .
[4] Janis Buls,et al. The Lattice of Machine Invariant Sets and Subword Complexity , 2005, ArXiv.
[5] G. A. Edgar. Measure, Topology, and Fractal Geometry , 1990 .
[6] Arturo Capri. Repetitions in the Kolakovski sequence. , 1993 .
[7] Jörg Endrullis,et al. Data-Oblivious Stream Productivity , 2008, LPAR.
[8] Andrej Muchnik,et al. Almost periodic sequences , 2003, Theor. Comput. Sci..
[9] R. Steacy. Structure in the Kolakoski Sequence , 1996, Bull. EATCS.
[10] Juhani Karhumäki,et al. Alternating Iteration of Morphisms and the Kolakovski Sequence , 1992 .
[11] Yuri Pritykin. Strongly Almost Periodic Sequences under Finite Automata Mappings , 2006, ArXiv.
[12] F. M. Dekking,et al. What is the Long Range Order in the Kolakoski Sequence , 1997 .
[13] Peter Gustav Lejeune Dirichlet,et al. Beweis des Satzes, dass jede unbegrenzte arithmetische Progression, deren erstes Glied und Differenz ganze Zahlen ohne gemeinschaftlichen Factor sind, unendlich viele Primzahlen enthält , 2012 .
[14] Aleksandrs Belovs,et al. Some Algebraic Properties of Machine Poset of Infinite Words , 2008, RAIRO Theor. Informatics Appl..
[15] Hartmut Jürgens,et al. Chaos and Fractals: New Frontiers of Science , 1992 .
[16] Jeffrey Shallit,et al. Automatic Sequences: Theory, Applications, Generalizations , 2003 .
[17] J. Allouche,et al. Toeplitz sequences, paperfolding, towers of Hanoi and progression-free sequence of integers , 1992 .
[18] Andrzej Ehrenfeucht,et al. Subword Complexities of Various Classes of Deterministic Developmental Languages without Interactions , 1975, Theor. Comput. Sci..
[19] Konrad Jacobs. Invitation to Mathematics , 1992 .
[20] Richard A. Holmgren. A First Course in Discrete Dynamical Systems , 1994 .
[21] Jacques Sakarovitch,et al. Elements of Automata Theory , 2009 .
[22] Benedikt Löwe. Complexity hierarchies derived from reduction functions , 2001, FotFS.
[23] M. Keane,et al. Generalized Morse sequences , 1968 .
[24] Judy A. Holdener,et al. WHEN THUE-MORSE MEETS KOCH , 2005 .
[25] Jan Willem Klop,et al. Productivity of stream definitions , 2010, Theor. Comput. Sci..
[26] M. Keane,et al. 0-1-sequences of Toeplitz type , 1969 .
[27] M. Lothaire. Algebraic Combinatorics on Words , 2002 .