Karel Culík II

According to our database, Karel Culík II authored at least 130 papers between 1967 and 2004.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2004

Fixed Point Approach to Commutation of Languages.

Karel Culík II, Juhani Karhumäki, Petri Salmela

Proceedings of the Aspects of Molecular Computing, 2004

2001

A Note on Synchronized Automata and Road Coloring Problem.

Karel Culík II, Juhani Karhumäki, Jarkko Kari

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

1999

Generalized Weighted Finite Automata Based Image Compression.

Karel Culík II, P. C. von Rosenberg

J. Univers. Comput. Sci., 1999

State Complexity of Basic Operations on Finite Languages.

Cezar Câmpeanu, Karel Culík II, Kai Salomaa, Sheng Yu

Proceedings of the Automata Implementation, 1999

Small Aperiodic Sets of Triangular and Hexagonal Tiles.

Karel Culík II

Proceedings of the Jewels are Forever, 1999

1997

Digital Images and Formal Languages.

Karel Culík II, Jarkko Kari

Proceedings of the Handbook of Formal Languages, Volume 3: Beyond Words., 1997

Compression of Silhouette-like Images based on WFA.

Karel Culík II, Vladimir Valenta, Jarkko Kari

J. Univers. Comput. Sci., 1997

Generalized Finite Automata and Transducers.

Karel Culík II, Vladimir Valenta

J. Autom. Lang. Comb., 1997

Finite automata based compression of bi-level and simple color images.

Karel Culík II, Vladimir Valenta

Comput. Graph., 1997

Computational Fractal Geometry with WFA.

Karel Culík II, Jarkko Kari

Acta Informatica, 1997

Implementing Daubechies Wavelet Transform with Weighted Finite Automata.

Karel Culík II, Simant Dube

Acta Informatica, 1997

On Aperiodic Sets of Wang Tiles.

Karel Culík II, Jarkko Kari

Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

1996

An aperiodic set of 13 Wang tiles.

Karel Culík II

Discret. Math., 1996

Finite state transformation of images.

Karel Culík II, Jarkko Kari

Comput. Graph., 1996

An Aperiodic Set of Wang Cubes.

Karel Culík II, Jarkko Kari

Proceedings of the STACS 96, 1996

Finite Automata Based Compression of Bi-level Images.

Karel Culík II, Vladimir Valenta

Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996

1995

Weighted Finite Transducers in Image Processing.

Karel Culík II, Ivan Fris

Discret. Appl. Math., 1995

Global Cellular Automata.

Karel Culík II

Complex Syst., 1995

Iterative Weighted Finite Transductions.

Karel Culík II, Peter Rajcáni

Acta Informatica, 1995

Finite State Transformations of Images.

Karel Culík II, Jarkko Kari

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Finite State Methods for Compression and Manipulation of Images.

Karel Culík II, Jarkko Kari

Proceedings of the IEEE Data Compression Conference, 1995

1994

Finite Automata Computing Real Functions.

Karel Culík II, Juhani Karhumäki

SIAM J. Comput., 1994

Image-Data Compression Using Edge-Optimizing Algorithm for WFA Inference.

Karel Culík II, Jarkko Kari

Inf. Process. Manag., 1994

Parallel Pattern Generation with One-Way Communications.

Karel Culík II, Jarkko Kari

Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993

Affine automata and related techniques for generation of complex images.

Karel Culík II, Simant Dube

Theor. Comput. Sci., 1993

Parametrized Recurrent Systems for Image Generation.

Karel Culík II, Jarkko Kari

Inf. Process. Lett., 1993

Encoding Images as Words and Languages.

Karel Culík II, Simant Dube

Int. J. Algebra Comput., 1993

Rational and Affine Expressions for Image Description.

Karel Culík II, Simant Dube

Discret. Appl. Math., 1993

Mechanisms for Pattern Generation.

Karel Culík II, Jarkko Kari

Complex Syst., 1993

Balancing order and chaos in image generation.

Karel Culík II, Simant Dube

Comput. Graph., 1993

L-Systems and Mutually Recursive Function Systems.

Karel Culík II, Simant Dube

Acta Informatica, 1993

Efficient Compression of Wavelet Coefficients for Smooth and Fractal-like Data.

Karel Culík II, Simant Dube

Proceedings of the STACS 93, 1993

Image Compression Using Weighted Finite Automata.

Karel Culík II, Jarkko Kari

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

On the Power of L-Systems in Image Generation.

Karel Culík II, Jarkko Kari

Proceedings of the Developments in Language Theory, 1993

Efficient Compression of Wavelet Coefficients for Smooth and Fractal-like Data.

Karel Culík II, Simant Dube, Peter Rajcáni

Proceedings of the IEEE Data Compression Conference, 1993

1992

Iterative Devices Generating Infinite Words.

Karel Culík II, Juhani Karhumäki

Proceedings of the STACS 92, 1992

1991

An Efficient Solution of the Firing Mob Problem.

Karel Culík II, Simant Dube

Theor. Comput. Sci., 1991

Cellular automata, omegaomega-regular sets, and sofic systems.

Karel Culík II, Sheng Yu

Discret. Appl. Math., 1991

Splicing semigroups of dominoes and DNA.

Karel Culík II, Tero Harju

Discret. Appl. Math., 1991

Balancing Order and Chaos in Image Generation (Extended Abstract).

Karel Culík II, Simant Dube

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

New Methods for Image Generation and Compression.

Karel Culík II, Simant Dube

Proceedings of the New Results and New Trends in Computer Science, 1991

1990

Loops in automata and HDTOL relations.

Karel Culík II, Juhani Karhumäki

RAIRO Theor. Informatics Appl., 1990

Affine Automata: A Technique to Generate Complex Images.

Karel Culík II, Simant Dube

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Methods for Generating Deterministic Fractals and Image Compression.

Karel Culík II, Simant Dube

Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

Automata-Theoretic Techniques for Image Generation and Compression.

Karel Culík II, Simant Dube

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990

1989

A note on HDTOL Languages and the Equivalence of Deterministic Pushdown Transducers.

Karel Culík II, Juhani Karhumäki

Proceedings of the A Perspective in Theoretical Computer Science, 1989

On the Limit Sets of Cellular Automata.

Karel Culík II, Jan K. Pachl, Sheng Yu

SIAM J. Comput., 1989

Variations of the Firing Squad Problem and Applications.

Karel Culík II

Inf. Process. Lett., 1989

Fractal and Recurrent Behavior of Cellular Automata.

Karel Culík II, Simant Dube

Complex Syst., 1989

HDTOL Matching of Computations of Multitape Automata.

Karel Culík II, Juhani Karhumäki

Acta Informatica, 1989

On the Equivalence Problem for Deterministic Multitape Automata and Transducers.

Karel Culík II, Juhani Karhumäki

Proceedings of the STACS 89, 1989

Dominoes and the Regularity of DNS Splicing Languages.

Karel Culík II, Tero Harju

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

1988

On Totalistic Systolic Networks.

Karel Culík II, Juhani Karhumäki

Inf. Process. Lett., 1988

Undecidability of CA Classification Schemes.

Karel Culík II, Sheng Yu

Complex Syst., 1988

New Techniques for Proving the Decidability of Equivalence Problems.

Karel Culík II

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987

The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDT0L Languages) is Decidable.

Karel Culík II, Juhani Karhumäki

SIAM J. Comput., 1987

On Invertible Cellular Automata.

Karel Culík II

Complex Syst., 1987

A Simple Universal Cellular Automaton and its One-Way and Totalistic Version.

Jürgen Albert, Karel Culík II

Complex Syst., 1987

The Equivalence Problem for n-Tape Finite Automata with Simple Cycles.

Karel Culík II, Matti Linna

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

1986

Systolic Trellis Automata: Stability, Decidability and Complexity

Karel Culík II, Jozef Gruska, Arto Salomaa

Inf. Control., December, 1986

Real-Time, Pseudo Real-Time, and Linear-Time ITA.

Karel Culík II, Sheng Yu

Theor. Comput. Sci., 1986

The Equivalence of Finite Valued Transducers (On HDT0L Languages) is Decidable.

Karel Culík II, Juhani Karhumäki

Theor. Comput. Sci., 1986

A Note on the Equivalence Problem of Rational Formal Power Series.

Karel Culík II, Juhani Karhumäki

Inf. Process. Lett., 1986

Synchronizable Deterministic Pushdown Automata and the Decidability of their Equivalence.

Karel Culík II, Juhani Karhumäki

Acta Informatica, 1986

The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable.

Karel Culík II, Juhani Karhumäki

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985

Topological Transformations as a Tool in the Design of Systolic Networks.

Karel Culík II, Ivan Fris

Theor. Comput. Sci., 1985

Decision problems solved with the help of the Ehrenfeucht conjecture.

Karel Culík II, Juhani Karhumäki

Bull. EATCS, 1985

Translation of Systolic Algorithms between Systems of Different Topology.

Karel Culík II, Sheng Yu

Proceedings of the International Conference on Parallel Processing, 1985

1984

Iterative Tree Automata.

Karel Culík II, Sheng Yu

Theor. Comput. Sci., 1984

Context-Free Complexity of Finite Languages.

Walter Bucher, Hermann A. Maurer, Karel Culík II

Theor. Comput. Sci., 1984

The omega-Sequence Problem for DOL Systems Is Decidable.

Karel Culík II, Tero Harju

J. ACM, 1984

Systolic Tree Acceptors.

Karel Culík II, Arto Salomaa, Derick Wood

RAIRO Theor. Informatics Appl., 1984

On Real Time and Linear Time Cellular Automata.

Walter Bucher, Karel Culík II

RAIRO Theor. Informatics Appl., 1984

On Real-Time Cellular Automata and Trellis Automata.

Christian Choffrut, Karel Culík II

Acta Informatica, 1984

On Extendibility of Unavoidable Sets.

Christian Choffrut, Karel Culík II

Proceedings of the STACS 84, 1984

1983

On a Family of L Languages Resulting from Systolic Tree Automata.

Karel Culík II, Jozef Gruska, Arto Salomaa

Theor. Comput. Sci., 1983

Properties of Finite and Pushdown Transducers.

Christian Choffrut, Karel Culík II

SIAM J. Comput., 1983

On the Ehrenfeucht Conjecture for DOL Languages.

Karel Culík II, Juhani Karhumäki

RAIRO Theor. Informatics Appl., 1983

Folding of the Plane and the Design of Systolic Arrays.

Christian Choffrut, Karel Culík II

Inf. Process. Lett., 1983

Systems of equations over a free monoid and Ehrenfeucht's conjecture.

Karel Culík II, Juhani Karhumäki

Discret. Math., 1983

Logic versus mathematics in computer science education.

Karel Culík II, Mateen M. Rizki

Proceedings of the 14th SIGCSE Technical Symposium on Computer Science Education, 1983

Ambiguity and Decision Problems Concerning Number Systems.

Karel Culík II, Arto Salomaa

Proceedings of the Automata, 1983

Two Way Finite State Generators.

Karel Culík II, Emo Welzl

Proceedings of the Fundamentals of Computation Theory, 1983

1982

Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid

Jürgen Albert, Karel Culík II, Juhani Karhumäki

Inf. Control., February, 1982

On Infinite Words Obtained by Iterating Morphisms.

Karel Culík II, Arto Salomaa

Theor. Comput. Sci., 1982

Dominoes Over a Free Monoid.

Karel Culík II, Tero Harju

Theor. Comput. Sci., 1982

Tree Correspondence Problems.

Jürgen Albert, Karel Culík II

J. Comput. Syst. Sci., 1982

A Note on Some Tree Similarity Measures.

Karel Culík II, Derick Wood

Inf. Process. Lett., 1982

A homomorphic characterization of regular languages.

Karel Culík II, Faith E. Fich, Arto Salomaa

Discret. Appl. Math., 1982

Systolic Automata for VLSI on Balanced Trees.

Karel Culík II, Jozef Gruska, Arto Salomaa

Acta Informatica, 1982

Folding and Unrolling Systolic Arrays (Preliminary Version).

Karel Culík II, Jan K. Pachl

Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

On Test Sets and the Ehrenfeucht Conjecture.

Karel Culík II

Proceedings of the Automata, 1982

1981

A Note on Recurrent Words

Karel Culík II, Derick Wood

Inf. Control., October, 1981

Equivalence Problems for Mappings on Infinite Strings

Karel Culík II, Jan K. Pachl

Inf. Control., April, 1981

Dense Multiway Trees.

Karel Culík II, Thomas Ottmann, Derick Wood

ACM Trans. Database Syst., 1981

Concise Description of Finite Languages.

Walter Bucher, Hermann A. Maurer, Karel Culík II, Detlef Wotschke

Theor. Comput. Sci., 1981

The omega-Sequence Equivalence Problem for DOL Systems Is Decidable

Karel Culík II, Tero Harju

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

1980

Test Sets and Checking Words for Homomorphism Equivalence.

Karel Culík II, Arto Salomaa

J. Comput. Syst. Sci., 1980

On the Equality Sets for Homomorphisms on Free Monoids with Two Generators.

Karel Culík II, Juhani Karhumäki

RAIRO Theor. Informatics Appl., 1980

Test Sets for Homomorphism Equivalence on Context Free Languages.

Jürgen Albert, Karel Culík II

Proceedings of the Automata, 1980

1979

A Mathematical Investigation of Propagating Graph 0L Systems

Karel Culík II, Derick Wood

Inf. Control., October, 1979

A Purely Homomorphic Characterization of Recursively Enumerable Sets.

Karel Culík II

J. ACM, 1979

On simple representations of language families.

Karel Culík II, Hermann A. Maurer

RAIRO Theor. Informatics Appl., 1979

Secure Information Storage and Retrieval Using New Results in Cryptography.

Karel Culík II, Hermann A. Maurer

Inf. Process. Lett., 1979

Some Decidability Results About Regular and Pushdown Translations.

Karel Culík II

Inf. Process. Lett., 1979

Doubly deterministic tabled OL systems.

Karel Culík II, Derek Wood

Int. J. Parallel Program., 1979

Interactive L Systems with Almost Interactionless Behaviour.

Karel Culík II, Juhani Karhumäki

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

On the Homomorphic Characterizations of Families of Languages.

Karel Culík II

Proceedings of the Automata, 1979

1978

Propagating Chain-Free Normal Forms for EOL Systems

Karel Culík II, Hermann A. Maurer

Inf. Control., March, 1978

Isomorphism, Form Equivalence and Sequence Equivalence of PD0L Forms.

Karel Culík II, Hermann A. Maurer, Thomas Ottmann, Keijo Ruohonen, Arto Salomaa

Theor. Comput. Sci., 1978

On Two-Symbol Complete E0L Forms.

Karel Culík II, Hermann A. Maurer, Thomas Ottmann

Theor. Comput. Sci., 1978

On the Decidability of Homomorphism Equivalence for Languages.

Karel Culík II, Arto Salomaa

J. Comput. Syst. Sci., 1978

Speed-varying _OL systems.

Karel Culík II, Derick Wood

Inf. Sci., 1978

The Decidability of v-Local Catenativity and of Other Properties of D0L Systems.

Karel Culík II

Inf. Process. Lett., 1978

The Ultimate Equivalence Problem for DOL Systems.

Karel Culík II

Acta Informatica, 1978

1977

The Decidability of the Equivalence Problem for DOL-Systems

Karel Culík II, Ivan Fris

Inf. Control., September, 1977

Tree controlled grammars.

Karel Culík II, Hermann A. Maurer

Computing, 1977

The Sequence Equivalence Problem for D0L Systems is Decidable.

Karel Culík II, Ivan Fris

Proceedings of the Automata, 1977

1976

On the Decidability of the Sequence Equivalence Problem for D0L-Systems.

Karel Culík II

Theor. Comput. Sci., 1976

1975

Time Complexity of Recognition and Parsing of E0L-Languages.

Jaroslav Opatrny, Karel Culík II

Proceedings of the Automata, Languages, Development: At the crossroads of biology, mathematics and computer science, result of an international conference held at Noordwijkerhout, The Netherlands, March 31, 1975

1974

Parallel Rewriting Systems on terms.

Karel Culík II, T. S. E. Maibaum

Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

Context in Parallel Rewriting.

Karel Culík II, Jaroslav Opatrny

Proceedings of the L Systems, 1974

Structured 0L-Systems.

Karel Culík II

Proceedings of the L Systems, 1974

1971

Abstract Families of Relations.

Karel Culík II

J. Comput. Syst. Sci., 1971

Classification of Noncounting Events.

Janusz A. Brzozowski, Karel Culík II, Armen Gabrielian

J. Comput. Syst. Sci., 1971

LR-Regular Grammars-An Extension of LR(k) Grammars

Rina S. Cohen, Karel Culík II

Proceedings of the 12th Annual Symposium on Switching and Automata Theory, 1971

1970

n-ary grammars and the description of mapping of languages.

Karel Culík II

Kybernetika, 1970

1968

Contribution to deterministic top-down analysis of context-free languages.

Karel Culík II

Kybernetika, 1968

1967

Sequential machines with several input and output tapes.

Karel Culík II

Kybernetika, 1967

Relations defined by n-tape automata.

Karel Culík II

Kybernetika, 1967