Karel Culík II

Publication Activity (10 Years)

Years Active: 1967-2004
Publications (10 Years): 0

Publications

Karel Culík II, Juhani Karhumäki, Petri Salmela
Fixed Point Approach to Commutation of Languages. Aspects of Molecular Computing (2004)
Karel Culík II, Juhani Karhumäki, Jarkko Kari
A Note on Synchronized Automata and Road Coloring Problem. Int. J. Found. Comput. Sci. 13 (3) (2002)
Karel Culík II, Juhani Karhumäki, Jarkko Kari
A Note on Synchronized Automata and Road Coloring Problem. Developments in Language Theory (2001)
Karel Culík II
Small Aperiodic Sets of Triangular and Hexagonal Tiles. Jewels are Forever (1999)
Cezar Câmpeanu, Karel Culík II, Kai Salomaa, Sheng Yu
State Complexity of Basic Operations on Finite Languages. WIA (1999)
Karel Culík II, P. C. von Rosenberg
Generalized Weighted Finite Automata Based Image Compression. J. Univers. Comput. Sci. 5 (4) (1999)
Karel Culík II, Vladimir Valenta, Jarkko Kari
Compression of Silhouette-like Images based on WFA. J. Univers. Comput. Sci. 3 (10) (1997)
Karel Culík II, Jarkko Kari
On Aperiodic Sets of Wang Tiles. Foundations of Computer Science: Potential - Theory - Cognition (1997)
Karel Culík II, Simant Dube
Implementing Daubechies Wavelet Transform with Weighted Finite Automata. Acta Informatica 34 (5) (1997)
Karel Culík II, Jarkko Kari
Computational Fractal Geometry with WFA. Acta Informatica 34 (2) (1997)
Karel Culík II, Vladimir Valenta
Finite automata based compression of bi-level and simple color images. Comput. Graph. 21 (1) (1997)
Karel Culík II, Vladimir Valenta
Generalized Finite Automata and Transducers. J. Autom. Lang. Comb. 2 (1) (1997)
Karel Culík II, Vladimir Valenta
Finite Automata Based Compression of Bi-level Images. Data Compression Conference (1996)
Karel Culík II, Jarkko Kari
An Aperiodic Set of Wang Cubes. STACS (1996)
Karel Culík II, Jarkko Kari
Finite state transformation of images. Comput. Graph. 20 (1) (1996)
Karel Culík II
An aperiodic set of 13 Wang tiles. Discret. Math. 160 (1-3) (1996)
Karel Culík II
Global Cellular Automata. Complex Syst. 9 (4) (1995)
Karel Culík II, Peter Rajcáni
Iterative Weighted Finite Transductions. Acta Informatica 32 (7) (1995)
Karel Culík II, Jarkko Kari
Finite State Methods for Compression and Manipulation of Images. Data Compression Conference (1995)
Karel Culík II, Ivan Fris
Weighted Finite Transducers in Image Processing. Discret. Appl. Math. 58 (3) (1995)
Karel Culík II, Jarkko Kari
An Aperiodic Set of Wang Cubes. J. Univers. Comput. Sci. 1 (10) (1995)
Karel Culík II, Jarkko Kari
Finite State Transformations of Images. ICALP (1995)
Karel Culík II, Jarkko Kari
On the Power of L-Systems in Image Generation. Acta Informatica 31 (8) (1994)
Karel Culík II, Jarkko Kari
Parallel Pattern Generation with One-Way Communications. Results and Trends in Theoretical Computer Science (1994)
Karel Culík II, Jarkko Kari
Image-Data Compression Using Edge-Optimizing Algorithm for WFA Inference. Inf. Process. Manag. 30 (6) (1994)
Karel Culík II, Juhani Karhumäki
Iterative Devices Generating Infinite Words. Int. J. Found. Comput. Sci. 5 (1) (1994)
Karel Culík II, Juhani Karhumäki
Finite Automata Computing Real Functions. SIAM J. Comput. 23 (4) (1994)
Karel Culík II, Simant Dube
Affine automata and related techniques for generation of complex images. Theor. Comput. Sci. 116 (2) (1993)
Karel Culík II, Simant Dube
Efficient Compression of Wavelet Coefficients for Smooth and Fractal-like Data. STACS (1993)
Karel Culík II, Simant Dube
Rational and Affine Expressions for Image Description. Discret. Appl. Math. 41 (2) (1993)
Karel Culík II, Jarkko Kari
Parametrized Recurrent Systems for Image Generation. Inf. Process. Lett. 48 (6) (1993)
Karel Culík II, Simant Dube
L-Systems and Mutually Recursive Function Systems. Acta Informatica 30 (3) (1993)
Karel Culík II, Simant Dube
Balancing order and chaos in image generation. Comput. Graph. 17 (4) (1993)
Karel Culík II, Jarkko Kari
Image compression using weighted finite automata. Comput. Graph. 17 (3) (1993)
Karel Culík II, Simant Dube
Encoding Images as Words and Languages. Int. J. Algebra Comput. 3 (2) (1993)
Karel Culík II, Jarkko Kari
Image Compression Using Weighted Finite Automata. MFCS (1993)
Karel Culík II, Jarkko Kari
Mechanisms for Pattern Generation. Complex Syst. 7 (5) (1993)
Karel Culík II, Jarkko Kari
On the Power of L-Systems in Image Generation. Developments in Language Theory (1993)
Karel Culík II, Simant Dube, Peter Rajcáni
Efficient Compression of Wavelet Coefficients for Smooth and Fractal-like Data. Data Compression Conference (1993)
Karel Culík II, Juhani Karhumäki
Iterative Devices Generating Infinite Words. STACS (1992)
Karel Culík II, Simant Dube
New Methods for Image Generation and Compression. New Results and New Trends in Computer Science (1991)
Karel Culík II, Tero Harju
Splicing semigroups of dominoes and DNA. Discret. Appl. Math. 31 (3) (1991)
Karel Culík II, Simant Dube
An Efficient Solution of the Firing Mob Problem. Theor. Comput. Sci. 91 (1) (1991)
Karel Culík II, Simant Dube
Balancing Order and Chaos in Image Generation (Extended Abstract). ICALP (1991)
Karel Culík II, Sheng Yu
Cellular automata, omegaomega-regular sets, and sofic systems. Discret. Appl. Math. 32 (2) (1991)
Karel Culík II
New Techniques for Proving the Decidability of Equivalence Problems. Theor. Comput. Sci. 71 (1) (1990)
Karel Culík II, Simant Dube
Methods for Generating Deterministic Fractals and Image Compression. IMYCS (1990)
Karel Culík II, Simant Dube
Automata-Theoretic Techniques for Image Generation and Compression. FSTTCS (1990)
Karel Culík II, Juhani Karhumäki
Loops in automata and HDTOL relations. RAIRO Theor. Informatics Appl. 24 (1990)
Karel Culík II, Simant Dube
Affine Automata: A Technique to Generate Complex Images. MFCS (1990)
Karel Culík II, Juhani Karhumäki
On the Equivalence Problem for Deterministic Multitape Automata and Transducers. STACS (1989)
Karel Culík II
Variations of the Firing Squad Problem and Applications. Inf. Process. Lett. 30 (3) (1989)
Karel Culík II, Jan K. Pachl, Sheng Yu
On the Limit Sets of Cellular Automata. SIAM J. Comput. 18 (4) (1989)
Karel Culík II, Juhani Karhumäki
HDTOL Matching of Computations of Multitape Automata. Acta Informatica 27 (2) (1989)
Karel Culík II, Tero Harju
Dominoes and the Regularity of DNS Splicing Languages. ICALP (1989)
Karel Culík II, Simant Dube
Fractal and Recurrent Behavior of Cellular Automata. Complex Syst. 3 (3) (1989)
Karel Culík II, Juhani Karhumäki
On Totalistic Systolic Networks. Inf. Process. Lett. 26 (5) (1988)
Karel Culík II
New Techniques for Proving the Decidability of Equivalence Problems. ICALP (1988)
Karel Culík II, Sheng Yu
Undecidability of CA Classification Schemes. Complex Syst. 2 (2) (1988)
Karel Culík II, Matti Linna
The Equivalence Problem for n-Tape Finite Automata with Simple Cycles. FSTTCS (1987)
Karel Culík II, Juhani Karhumäki
The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDT0L Languages) is Decidable. SIAM J. Comput. 16 (2) (1987)
Jürgen Albert, Karel Culík II
A Simple Universal Cellular Automaton and its One-Way and Totalistic Version. Complex Syst. 1 (1) (1987)
Karel Culík II
On Invertible Cellular Automata. Complex Syst. 1 (6) (1987)
Karel Culík II, Juhani Karhumäki
A Note on the Equivalence Problem of Rational Formal Power Series. Inf. Process. Lett. 23 (1) (1986)
Karel Culík II, Jozef Gruska, Arto Salomaa
Systolic Trellis Automata: Stability, Decidability and Complexity Inf. Control. 71 (3) (1986)
Karel Culík II, Sheng Yu
Real-Time, Pseudo Real-Time, and Linear-Time ITA. Theor. Comput. Sci. 47 (3) (1986)
Karel Culík II, Juhani Karhumäki
The Equivalence of Finite Valued Transducers (On HDT0L Languages) is Decidable. Theor. Comput. Sci. 47 (3) (1986)
Karel Culík II, Juhani Karhumäki
Synchronizable Deterministic Pushdown Automata and the Decidability of their Equivalence. Acta Informatica 23 (5) (1986)
Karel Culík II, Juhani Karhumäki
The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable. MFCS (1986)
Karel Culík II, Juhani Karhumäki
Decision problems solved with the help of the Ehrenfeucht conjecture. Bull. EATCS 27 (1985)
Karel Culík II, Ivan Fris
Topological Transformations as a Tool in the Design of Systolic Networks. Theor. Comput. Sci. 37 (1985)
Karel Culík II, Sheng Yu
Translation of Systolic Algorithms between Systems of Different Topology. ICPP (1985)
Karel Culík II, Tero Harju
The omega-Sequence Problem for DOL Systems Is Decidable. J. ACM 31 (2) (1984)
Karel Culík II, Sheng Yu
Iterative Tree Automata. Theor. Comput. Sci. 32 (1984)
Karel Culík II, Arto Salomaa, Derick Wood
Systolic Tree Acceptors. RAIRO Theor. Informatics Appl. 18 (1) (1984)
Christian Choffrut, Karel Culík II
On Real-Time Cellular Automata and Trellis Automata. Acta Informatica 21 (1984)
Walter Bucher, Karel Culík II
On Real Time and Linear Time Cellular Automata. RAIRO Theor. Informatics Appl. 18 (4) (1984)
Christian Choffrut, Karel Culík II
On extendibility of unavoidable sets. Discret. Appl. Math. 9 (2) (1984)
Walter Bucher, Hermann A. Maurer, Karel Culík II
Context-Free Complexity of Finite Languages. Theor. Comput. Sci. 28 (1984)
Christian Choffrut, Karel Culík II
On Extendibility of Unavoidable Sets. STACS (1984)
Karel Culík II, Mateen M. Rizki
Logic versus mathematics in computer science education. SIGCSE (1983)
Karel Culík II, Arto Salomaa
Ambiguity and Decision Problems Concerning Number Systems Inf. Control. 56 (3) (1983)
Karel Culík II, Juhani Karhumäki
Systems of equations over a free monoid and Ehrenfeucht's conjecture. Discret. Math. 43 (2-3) (1983)
Karel Culík II, Emo Welzl
Two Way Finite State Generators. FCT (1983)
Karel Culík II, Arto Salomaa
Ambiguity and Decision Problems Concerning Number Systems. ICALP (1983)
Christian Choffrut, Karel Culík II
Properties of Finite and Pushdown Transducers. SIAM J. Comput. 12 (2) (1983)
Christian Choffrut, Karel Culík II
Folding of the Plane and the Design of Systolic Arrays. Inf. Process. Lett. 17 (3) (1983)
Karel Culík II, Jozef Gruska, Arto Salomaa
On a Family of L Languages Resulting from Systolic Tree Automata. Theor. Comput. Sci. 23 (1983)
Karel Culík II, Juhani Karhumäki
On the Ehrenfeucht Conjecture for DOL Languages. RAIRO Theor. Informatics Appl. 17 (3) (1983)
Karel Culík II, Jan K. Pachl
Folding and Unrolling Systolic Arrays (Preliminary Version). PODC (1982)
Karel Culík II, Faith E. Fich, Arto Salomaa
A homomorphic characterization of regular languages. Discret. Appl. Math. 4 (2) (1982)
Karel Culík II
On Test Sets and the Ehrenfeucht Conjecture. ICALP (1982)
Karel Culík II, Derick Wood
A Note on Some Tree Similarity Measures. Inf. Process. Lett. 15 (1) (1982)
Karel Culík II, Jozef Gruska, Arto Salomaa
Systolic Automata for VLSI on Balanced Trees. Acta Informatica 18 (1982)
Karel Culík II, Tero Harju
Dominoes Over a Free Monoid. Theor. Comput. Sci. 18 (1982)
Karel Culík II, Arto Salomaa
On Infinite Words Obtained by Iterating Morphisms. Theor. Comput. Sci. 19 (1982)
Jürgen Albert, Karel Culík II, Juhani Karhumäki
Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid Inf. Control. 52 (2) (1982)
Jürgen Albert, Karel Culík II
Tree Correspondence Problems. J. Comput. Syst. Sci. 24 (2) (1982)
Walter Bucher, Hermann A. Maurer, Karel Culík II, Detlef Wotschke
Concise Description of Finite Languages. Theor. Comput. Sci. 14 (1981)
Karel Culík II, Jan K. Pachl
Equivalence Problems for Mappings on Infinite Strings Inf. Control. 49 (1) (1981)

Karel Culík II.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Karel Culík II