Coinductive properties of causal maps

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5140 LNCS, Issue , 2008, Pages 253-267

  Kim, Jiho ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSURE PROPERTIES; INTERNATIONAL CONFERENCES; SOFTWARE TECHNOLOGIES;

COMPUTER NETWORKS; MATRIX ALGEBRA; TECHNOLOGY;

RIVERS;

EID: 51049117094     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79980-1_20     Document Type: Conference Paper

References (9)

1. Akin, E.: Why is the 3x + 1 problem hard? In: Akin, E. (ed.) Chapel Hill Ergodic Theory Workshops, Contemp. Math. 356, Amer. Math. Soc., pp. 1-20 (2004)
2. Bernstein, D.J., Lagarias, J.C.: The 3x + 1 Conjugacy Map. Can. J. Math. 48, 1154-1169 (1996)
3. Hansen, H.H., Costa, D., Rutten, J.J.M.M.: Synthesis of Mealy machines using derivatives. In: Proceedings of the 9th Workshop on Coalgebraic Methods in Computer Science (CMCS 2006), Vienna, Austria. ENTCS, vol. 164, pp. 27-45 (2006)
4. Koblitz, N.: p-adic Numbers, p-adic Analysis, and Zeta-Functions. Graduate Texts in Mathematics, vol. 58. Springer, Heidelberg (1977)
5. Lagarias, J.C., The 3x+l problem: An annotated bibliography (1963-2000), http://www.arxiv.org/abs/math/0309224
6. Lagarias, J.C, The 3x+l problem: An annotated bibliography (2000-), http://www.arxiv.org/abs/math/0608208
7. Rutten, J.J.M.M.: Algebraic specification and coalgebraic synthesis of Mealy automata. Electr. Notes Theor. Comput. Sci. 160, 305-319 (2006)
8. Rutten, J.J.M.M.: Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theor. Comput. Sci. 308, 1-53 (2003)
9. Rutten, J.J.M.M.: Universal Coalgebra: a Theory of Systems. Theor. Comput. Sci. 249, 3-80 (2000)