References

[abdallah2010]Abdallah, S. A., Plumbley, M. D. (2010) A Measure of Statistical Complexity Based on Predictive Information. arxiv:1012.1890
[almeida2007]Almeida, M., Moreira, N., & Reis, R. (2007). Enumeration and Generation of Initially Connected Deterministic Finite Automata. Technical Report DCC-2006-07. Universidade do Porto. url.
[bell2003]Bell, A. J. (2003). The co-information lattice. In Proceedings of the Fifth International Workshop on Independent Component Analysis and Blind Signal Separation: ICA 2003. pdf
[cover2006]Cover, T., Thomas, J. (2006) Elements of Information Theory 2nd Edition. New York: Wiley.
[crutchfield2009]Crutchfield, J., Ellison, C., Mahoney, J. (2009) Time’s Barbed Arrow: Irreversibility, Crypticity, and Stored Information. arxiv:0902.1209
[delgenio2010]Del Genio, C. I., Kim, H., Toroczkai, Z., & Bassler, K. E. (2010). Efficient and exact sampling of simple graphs with given arbitrary degree sequence. arxiv:1002.2975
[ellison2009]Ellison, C,. Mahoney, J., Crutchfield J. (2009) Prediction, Retrodiction, and The Amount of Information Stored in the Present. arxiv:0905.3587
[gries1973]Gries, D. (1973). Describing an algorithm by Hopcroft. Acta Informatica, 2(2), 97-109. doi:10.1007/BF00264025
[hopcroft1971]Hopcroft, J. (1971). An n log n algorithm for minimizing states in a finite automaton (Technical Report: CS-TR-71-190). Stanford. pdf
[jakulin2004]Jakulin, A., Bratko, I. (2004). Quantifying and Visualizing Attribute Interactions. arxiv:cs/0308002v3
[mahoney2009a]Mahoney, J., Ellison, C., Crutchfield, J. (2009) Information Accessibility and Cryptic Processes. arxiv:0905.4787
[mahoney2009b]Mahoney, J., Ellison, C., Crutchfield, J. (2009) Information Accessibility and Cryptic Processes: Linear Combinations of Causal States. arxiv:0906.5099
[seljebotn2009]Seljebotn, D. S. (2009). Fast numerical computations with Cython. In Proceedings of the 8th Python in Science conference (pp. 15-22). Presented at SciPy 2009. url
[sipser2006]Sipser, M (2006). Introduction to the Theory of Computation.
[strelioff2007]Strelioff, C. C., Crutchfield, J. P., & Hubler, A. W. (2007). Inferring Markov chains: Bayesian estimation, model comparison, entropy rate, and out-of-class modeling. Physical Review E, 76(1), 011106. doi:10.1103/PhysRevE.76.011106
[upper1997]Upper, D. R. (1997). Theory and Algorithms for Hidden Markov Models and Generalized Hidden Markov Models. PhD thesis, University of California, Berkeley. Published by University Microfilms Intl. Ann Arbor, Michigan. pdf
[wanatabe1960]Watanabe, S. (1960). Information Theoretical Analysis of Multivariate Correlation, IBM Journal of Research and Development 4, 66–82 pdf
[williams2010]Williams, Paul L., Beer, Randall D. (2010) Nonnegative Decomposition of Multivariate Information. arxiv:1004.2515
[yeung1991]Yeung, R. W. (1991). A New Outlook on Shannon’s Information Measures. IEEE Transactions on Information Theory, Vol. 37, No. 3.
[zambella1988]Zambella, D., & Grassberger, P. (1988). Complexity of Forecasting in a Class of Simple Models. Complex Systems, 2, 269-303.