Karel Culík II

  • University of South Carolina, Columbia, SC, USA
  • Wayne State University, Detroit, MI, USA (former)
  • Pennsylvania State University, University Park, PA, USA (former)
  • Academy of Sciences of the Czech Republic, Prague, Czech Republic (former)

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

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Fixed Point Approach to Commutation of Languages.
Proceedings of the Aspects of Molecular Computing, 2004

A Note on Synchronized Automata and Road Coloring Problem.
Int. J. Found. Comput. Sci., 2002

Generalized Weighted Finite Automata Based Image Compression.
J. Univers. Comput. Sci., 1999

State Complexity of Basic Operations on Finite Languages.
Proceedings of the Automata Implementation, 1999

Small Aperiodic Sets of Triangular and Hexagonal Tiles.
Proceedings of the Jewels are Forever, 1999

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

Compression of Silhouette-like Images based on WFA.
J. Univers. Comput. Sci., 1997

Generalized Finite Automata and Transducers.
J. Autom. Lang. Comb., 1997

Finite automata based compression of bi-level and simple color images.
Comput. Graph., 1997

Computational Fractal Geometry with WFA.
Acta Informatica, 1997

Implementing Daubechies Wavelet Transform with Weighted Finite Automata.
Acta Informatica, 1997

On Aperiodic Sets of Wang Tiles.
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

An aperiodic set of 13 Wang tiles.
Discret. Math., 1996

Finite state transformation of images.
Comput. Graph., 1996

Finite Automata Based Compression of Bi-level Images.
Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996

An Aperiodic Set of Wang Cubes.
J. Univers. Comput. Sci., 1995

Weighted Finite Transducers in Image Processing.
Discret. Appl. Math., 1995

Global Cellular Automata.
Complex Syst., 1995

Iterative Weighted Finite Transductions.
Acta Informatica, 1995

Finite State Transformations of Images.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Finite State Methods for Compression and Manipulation of Images.
Proceedings of the IEEE Data Compression Conference, 1995

Finite Automata Computing Real Functions.
SIAM J. Comput., 1994

Image-Data Compression Using Edge-Optimizing Algorithm for WFA Inference.
Inf. Process. Manag., 1994

Iterative Devices Generating Infinite Words.
Int. J. Found. Comput. Sci., 1994

On the Power of L-Systems in Image Generation.
Acta Informatica, 1994

Parallel Pattern Generation with One-Way Communications.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

Affine automata and related techniques for generation of complex images.
Theor. Comput. Sci., 1993

Parametrized Recurrent Systems for Image Generation.
Inf. Process. Lett., 1993

Encoding Images as Words and Languages.
Int. J. Algebra Comput., 1993

Rational and Affine Expressions for Image Description.
Discret. Appl. Math., 1993

Mechanisms for Pattern Generation.
Complex Syst., 1993

Image compression using weighted finite automata.
Comput. Graph., 1993

Balancing order and chaos in image generation.
Comput. Graph., 1993

L-Systems and Mutually Recursive Function Systems.
Acta Informatica, 1993

Efficient Compression of Wavelet Coefficients for Smooth and Fractal-like Data.
Proceedings of the STACS 93, 1993

Efficient Compression of Wavelet Coefficients for Smooth and Fractal-like Data.
Proceedings of the IEEE Data Compression Conference, 1993

An Efficient Solution of the Firing Mob Problem.
Theor. Comput. Sci., 1991

Cellular automata, omegaomega-regular sets, and sofic systems.
Discret. Appl. Math., 1991

Splicing semigroups of dominoes and DNA.
Discret. Appl. Math., 1991

Balancing Order and Chaos in Image Generation (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

New Methods for Image Generation and Compression.
Proceedings of the New Results and New Trends in Computer Science, 1991

New Techniques for Proving the Decidability of Equivalence Problems.
Theor. Comput. Sci., 1990

Loops in automata and HDTOL relations.
RAIRO Theor. Informatics Appl., 1990

Affine Automata: A Technique to Generate Complex Images.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Methods for Generating Deterministic Fractals and Image Compression.
Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

Automata-Theoretic Techniques for Image Generation and Compression.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990

A note on HDTOL Languages and the Equivalence of Deterministic Pushdown Transducers.
Proceedings of the A Perspective in Theoretical Computer Science, 1989

On the Limit Sets of Cellular Automata.
SIAM J. Comput., 1989

Variations of the Firing Squad Problem and Applications.
Inf. Process. Lett., 1989

Fractal and Recurrent Behavior of Cellular Automata.
Complex Syst., 1989

HDTOL Matching of Computations of Multitape Automata.
Acta Informatica, 1989

On the Equivalence Problem for Deterministic Multitape Automata and Transducers.
Proceedings of the STACS 89, 1989

Dominoes and the Regularity of DNS Splicing Languages.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

On Totalistic Systolic Networks.
Inf. Process. Lett., 1988

Undecidability of CA Classification Schemes.
Complex Syst., 1988

The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDT0L Languages) is Decidable.
SIAM J. Comput., 1987

On Invertible Cellular Automata.
Complex Syst., 1987

A Simple Universal Cellular Automaton and its One-Way and Totalistic Version.
Complex Syst., 1987

The Equivalence Problem for n-Tape Finite Automata with Simple Cycles.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

Systolic Trellis Automata: Stability, Decidability and Complexity
Inf. Control., December, 1986

Real-Time, Pseudo Real-Time, and Linear-Time ITA.
Theor. Comput. Sci., 1986

The Equivalence of Finite Valued Transducers (On HDT0L Languages) is Decidable.
Theor. Comput. Sci., 1986

A Note on the Equivalence Problem of Rational Formal Power Series.
Inf. Process. Lett., 1986

Synchronizable Deterministic Pushdown Automata and the Decidability of their Equivalence.
Acta Informatica, 1986

The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

Topological Transformations as a Tool in the Design of Systolic Networks.
Theor. Comput. Sci., 1985

Decision problems solved with the help of the Ehrenfeucht conjecture.
Bull. EATCS, 1985

Translation of Systolic Algorithms between Systems of Different Topology.
Proceedings of the International Conference on Parallel Processing, 1985

Iterative Tree Automata.
Theor. Comput. Sci., 1984

Context-Free Complexity of Finite Languages.
Theor. Comput. Sci., 1984

The omega-Sequence Problem for DOL Systems Is Decidable.
J. ACM, 1984

Systolic Tree Acceptors.
RAIRO Theor. Informatics Appl., 1984

On Real Time and Linear Time Cellular Automata.
RAIRO Theor. Informatics Appl., 1984

On extendibility of unavoidable sets.
Discret. Appl. Math., 1984

On Real-Time Cellular Automata and Trellis Automata.
Acta Informatica, 1984

Ambiguity and Decision Problems Concerning Number Systems
Inf. Control., March, 1983

On a Family of L Languages Resulting from Systolic Tree Automata.
Theor. Comput. Sci., 1983

Properties of Finite and Pushdown Transducers.
SIAM J. Comput., 1983

On the Ehrenfeucht Conjecture for DOL Languages.
RAIRO Theor. Informatics Appl., 1983

Folding of the Plane and the Design of Systolic Arrays.
Inf. Process. Lett., 1983

Systems of equations over a free monoid and Ehrenfeucht's conjecture.
Discret. Math., 1983

Logic versus mathematics in computer science education.
Proceedings of the 14th SIGCSE Technical Symposium on Computer Science Education, 1983

Two Way Finite State Generators.
Proceedings of the Fundamentals of Computation Theory, 1983

Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid
Inf. Control., February, 1982

On Infinite Words Obtained by Iterating Morphisms.
Theor. Comput. Sci., 1982

Dominoes Over a Free Monoid.
Theor. Comput. Sci., 1982

Tree Correspondence Problems.
J. Comput. Syst. Sci., 1982

A Note on Some Tree Similarity Measures.
Inf. Process. Lett., 1982

A homomorphic characterization of regular languages.
Discret. Appl. Math., 1982

Systolic Automata for VLSI on Balanced Trees.
Acta Informatica, 1982

Folding and Unrolling Systolic Arrays (Preliminary Version).
Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

On Test Sets and the Ehrenfeucht Conjecture.
Proceedings of the Automata, 1982

A Note on Recurrent Words
Inf. Control., October, 1981

Equivalence Problems for Mappings on Infinite Strings
Inf. Control., April, 1981

Dense Multiway Trees.
ACM Trans. Database Syst., 1981

Concise Description of Finite Languages.
Theor. Comput. Sci., 1981

The omega-Sequence Equivalence Problem for DOL Systems Is Decidable
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

Test Sets for Homomorphism Equivalence on Context Free Languages
Inf. Control., June, 1980

Test Sets and Checking Words for Homomorphism Equivalence.
J. Comput. Syst. Sci., 1980

On the Equality Sets for Homomorphisms on Free Monoids with Two Generators.
RAIRO Theor. Informatics Appl., 1980

A Mathematical Investigation of Propagating Graph 0L Systems
Inf. Control., October, 1979

Interactive L Systems with Almost Interactionless Behaviour
Inf. Control., October, 1979

A Purely Homomorphic Characterization of Recursively Enumerable Sets.
J. ACM, 1979

On simple representations of language families.
RAIRO Theor. Informatics Appl., 1979

Secure Information Storage and Retrieval Using New Results in Cryptography.
Inf. Process. Lett., 1979

Some Decidability Results About Regular and Pushdown Translations.
Inf. Process. Lett., 1979

Doubly deterministic tabled OL systems.
Int. J. Parallel Program., 1979

On the Homomorphic Characterizations of Families of Languages.
Proceedings of the Automata, 1979

Propagating Chain-Free Normal Forms for EOL Systems
Inf. Control., March, 1978

Isomorphism, Form Equivalence and Sequence Equivalence of PD0L Forms.
Theor. Comput. Sci., 1978

On Two-Symbol Complete E0L Forms.
Theor. Comput. Sci., 1978

On the Decidability of Homomorphism Equivalence for Languages.
J. Comput. Syst. Sci., 1978

Speed-varying <sub>OL</sub> systems.
Inf. Sci., 1978

The Decidability of v-Local Catenativity and of Other Properties of D0L Systems.
Inf. Process. Lett., 1978

The Ultimate Equivalence Problem for DOL Systems.
Acta Informatica, 1978

The Decidability of the Equivalence Problem for DOL-Systems
Inf. Control., September, 1977

Tree controlled grammars.
Computing, 1977

The Sequence Equivalence Problem for D0L Systems is Decidable.
Proceedings of the Automata, 1977

On the Decidability of the Sequence Equivalence Problem for D0L-Systems.
Theor. Comput. Sci., 1976

Time Complexity of Recognition and Parsing of E0L-Languages.
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

Parallel Rewriting Systems on terms.
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

Context in Parallel Rewriting.
Proceedings of the L Systems, 1974

Structured 0L-Systems.
Proceedings of the L Systems, 1974

LR-Regular Grammars - an Extension of LR(k) Grammars.
J. Comput. Syst. Sci., 1973

Abstract Families of Relations.
J. Comput. Syst. Sci., 1971

Classification of Noncounting Events.
J. Comput. Syst. Sci., 1971

n-ary grammars and the description of mapping of languages.
Kybernetika, 1970

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

Sequential machines with several input and output tapes.
Kybernetika, 1967

Relations defined by n-tape automata.
Kybernetika, 1967