J. Kari, N. Ollinger.
Periodicity and Immortality in Reversible Computing.
Proceedings of MFCS 2008: International Symposium on
Mathematical Foundations of Computer Science,
Lecture Notes in computer Science 5162, 419-430,
Springer-Verlag, 2008.
J. Kari, S. Taati.
Combinatorics of Conservation Laws.
Bulletin of the European Association for Theoretical
Computer Science 95, 183-197, 2008.
C. Cruz-Reyes, J. Kari.
Non-Linear Subband Coding with Cellular Automata.
Proceedings of AFL 2008:
Automata and Formal Languages, 146-157,
Computer and Automation Research Institute, Hungarian Academy
of Sciences, 2008.
E. Formenti, J. Kari, S. Taati.
The Most General Conservation Law for a Cellular Automaton.
Proceedings of CSR 2008: Computer Science in Russia,
Lecture Notes in computer Science 5010, 194-203,
Springer-Verlag, 2008.
J. Kari. Undecidable properties on the dynamics of reversible
one-dimensional cellular automata.
Proceedings of JAC 2008: Journées Automates Cellulaires,
3-14, MCCME Publishing House Moscow, 2008. Also
http://hal.archives-ouvertes.fr/JAC2008
J. Kari, S. Taati.
A Particle Displacement Representation for Conservation Laws in Two-Dimensional Cellular Automata.
Proceedings of JAC 2008: Journées Automates Cellulaires,
65-73, MCCME Publishing House Moscow, 2008. Also
http://hal.archives-ouvertes.fr/JAC2008
M.-P. Beal, E. Czeizler, J. Kari, D. Perrin.
Unambiguous Automata.
Mathematics in Computer Science
1(4), 625–638, 2008.
J. Karhumäki, J. Kari, J. Kupke.
Binary operations on automatic functions.
RAIRO Informatique theorique et Applications 42, 217-236, 2008.
T. Boykett, J. Kari, S. Taati.
Conservation Laws in Rectangular CA.
Journal of Cellular Automata 3(2), 115-122, 2008.
J. Kari. Data Compression Codes, Lossy.
In: Wiley Encyclopedia of Computer Science and Engineering,
John Wiley & Sons, 2008.
http://dx.doi.org/10.1002/9780470050118.ecse093
J. Kari. On the undecidability of the tiling problem.
Proceedings of SOFSEM 2008: Theory and Practice of Computer Science,
Lecture Notes in computer Science 4910, 74-82,
Springer-Verlag, 2008.
J. Kari. The tiling Problem Revisited.
Proceedings of MCU 2007, Machines, Computations and Universality,
Lecture Notes in computer Science 4664, 72-79, Springer-Verlag, 2007.
J. Kari. Tason tiilityksistä (in Finnish).
Arkhimedes 4/2007, 19-24, 2007.
E. Czeizler, J. Kari.
A tight linear bound on the synchronization delay of bijective automata.
Theoretical Computer Science 380(1-2), 23-36, 2007.
J. Kari. Image processing using finite automata.
In Recent Advances in Formal Languages and Applications,
Studies in Computational Intelligence 25, 171-208,
Springer-Verlag, 2006.
M. Droste, J. Kari, P. Steinby.
Observations on the smoothness properties
of real functions computed by weighted finite automata.
Fundamenta Informaticae 73, 99-106, 2006.
A. Lagae, J. Kari, P. Dutre.
Aperiodic Sets of Square Tiles with Colored Corners.
Technical Report CW 460,
Department of Computer Science, K.U.Leuven, Leuven, Belgium, 2006.
E. Czeizler, J. Kari.
A tight linear bound on the neighborhood of inverse cellular automata.
Proceedings of ICALP 2005,
Automata, Languages and Programming, 32nd International
Colloquium.
Lecture Notes in computer Science 3580, 410-420, Springer-Verlag, 2005.
J.Kari.
Reversible Cellular Automata.
Proceedings of DLT 2005,
Developments in Language Theory.
Lecture Notes in computer Science 3572, 57-68, Springer-Verlag, 2005.
J. Kari.
Theory of Cellular Automata: a survey.
Theoretical Computer Science 334, 3-33, 2005.
V.Bernardi, B.Durand, E.Formenti, J.Kari.
A New Dimension Sensitive Property for
Cellular Automata.
Theoretical Computer Science 345, 235-247, 2005.
Conference version appeared in
Proceedings of MFCS'2004, 29th International Symposium on
Mathematical Foundations of Computer Science,
Lecture Notes in computer Science 3153, 416-426, Springer-Verlag, 2004.
J. Kari, C. Moore.
Rectangles and squares recognized by two-dimensional automata.
Theory is Forever, Essays Dedicated to Arto Salomaa on the
Occasion of His 70th Birthday.
Lecture Notes in Computer
Science 3113, 134-144, 2004.
J. Kari. The tiling problem and undecidability in cellular automata.
Proceedings of the International Workshop on Tilings and Cellular
Automata.
CDMTCS Research Report Series 253, 2004.
J. Kari.
Synchronizing finite automata on Eulerian digraphs.
Theoretical Computer Science 295, 223-232, 2003.
Conference version appeared in
Proceedings of MFCS'2001, 26th International Symposium on
Mathematical Foundations of Computer Science,
Lecture Notes in computer Science 2136, 432-438, Springer-Verlag, 2001.
J.Kari. Infinite snake tiling problems.
Proceedings of DLT'2002, Developments in Language Theory.
Lecture Notes in computer Science 2450, 67-77, Springer-Verlag, 2003.
L.Adleman, J.Kari, L.Kari, D.Reishus.
On the decidability of self-asssembly
of infinite ribbons. Proceedings of FOCS'2002,
43rd Annual Symposium on Foundations
of Computer Science, 530-537, 2002.
K.Culik, J.Karhumaki, J. Kari.
A note on Synchronized Automata and Road Coloring Problem.
International Journal of Foundations of Computer Science 13,
459-471, 2002.
Conference version appeared in
Proceedings of DLT'2001, Developments in Language Theory.
Lecture Notes in computer Science, Springer-Verlag.
L.Hong, R.Sannino, J.Kari.
Multi-stage block matching motion estimation
for superresolution video reconstruction.
Proceedings of SPIE, Visual Communications and Image Processing 2002
Vol. 4671, II, 1052-1060, 2002.
J. Kari. Synchronization and Stability of Finite Automata.
Journal of Universal Computer Science 8, 270-277, 2002.
J.Kari, C. Moore.
New results on alternating
and non-deterministic two-dimensional finite automata.
Proceedings of STACS'2001, 18th Annual Symposium on
Theoretical Aspects of Computer Science,
Lecture Notes in computer Science 2010,
396-406, Springer-Verlag, 2001.
J. Kari. A counter example to a conjecture concerning
synchronizing words in finite automata.
Bulletin of the European Association for Theoretical
Computer Science 73, p.146, 2001.
J. Kari.
Linear Cellular Automata with Multiple State Variables.
Proceedings of STACS'2000, 17th Annual Symposium on
Theoretical Aspects of Computer Science, Lecture
Notes in Computer Science 1770, Springer-Verlag, 110-121, 2000.
J. Kari, G. Liang, S. Dube, K. Kenemer, D.Gillman.
Fast Block Search Using Haar Decomposition.
Electronic Imaging 2000,
Proceedings of SPIE, vol. 3974, 2000.
J. Kari.
Recent results on aperiodic Wang tilings. In: Pattern formation
in biology, vision and dynamics.
A. Carbone, M. Gromov, P. Prusinkiewicz (Eds.),
World Scientific, Singapore, 83-96, 2000.
J. Kari, L.Kari. Context-free recombinations. In: Words,
sequences, languages: where computer science, biology and linguistics
meet, C.Martin-Vide, V.Mitrana (Eds.), Kluwer, The Netherlands, 2000.
J. Kari. On the circuit depth of structurally reversible
cellular automata. Fundamenta Informatica 38, 93-107, 1999.
J. Kari, P. Papasoglu.
Deterministic aperiodic tile sets.
Geometric And Functional Analysis 9, 353-369, 1999.