Karel Culík II

141 papers A* 12A 6B 9C 2Journal 97Unranked 13
YearRankTypeTitle / Venue / Authors
2004 — conf
Fixed Point Approach to Commutation of Languages.
Aspects of Molecular Computing
Karel Culík II, Juhani Karhumäki, Petri Salmela
2002 J jnl
A Note on Synchronized Automata and Road Coloring Problem.
Int. J. Found. Comput. Sci.
Karel Culík II, Juhani Karhumäki, Jarkko Kari
2001 C conf
A Note on Synchronized Automata and Road Coloring Problem.
Developments in Language Theory
Karel Culík II, Juhani Karhumäki, Jarkko Kari
1999 J jnl
Generalized Weighted Finite Automata Based Image Compression.
J. Univers. Comput. Sci.
Karel Culík II, P. C. von Rosenberg
1999 — conf
Small Aperiodic Sets of Triangular and Hexagonal Tiles.
Jewels are Forever
Karel Culík II
1999 — conf
State Complexity of Basic Operations on Finite Languages.
WIA
Cezar Câmpeanu, Karel Culík II, Kai Salomaa, Sheng Yu
1997 J jnl
Compression of Silhouette-like Images based on WFA.
J. Univers. Comput. Sci.
Karel Culík II, Vladimir Valenta, Jarkko Kari
1997 J jnl
Computational Fractal Geometry with WFA.
Acta Informatica
Karel Culík II, Jarkko Kari
1997 — ch.
Digital Images and Formal Languages.
Handbook of Formal Languages (3)
Karel Culík II, Jarkko Kari
1997 J jnl
Finite automata based compression of bi-level and simple color images.
Comput. Graph.
Karel Culík II, Vladimir Valenta
1997 J jnl
Generalized Finite Automata and Transducers.
J. Autom. Lang. Comb.
Karel Culík II, Vladimir Valenta
1997 J jnl
Implementing Daubechies Wavelet Transform with Weighted Finite Automata.
Acta Informatica
Karel Culík II, Simant Dube
1997 — conf
On Aperiodic Sets of Wang Tiles.
Foundations of Computer Science: Potential - Theory - Cognition
Karel Culík II, Jarkko Kari
1996 A conf
An Aperiodic Set of Wang Cubes.
STACS
Karel Culík II, Jarkko Kari
1996 J jnl
An aperiodic set of 13 Wang tiles.
Discret. Math.
Karel Culík II
1996 B conf
Finite Automata Based Compression of Bi-level Images.
Data Compression Conference
Karel Culík II, Vladimir Valenta
1996 J jnl
Finite state transformation of images.
Comput. Graph.
Karel Culík II, Jarkko Kari
1995 J jnl
An Aperiodic Set of Wang Cubes.
J. Univers. Comput. Sci.
Karel Culík II, Jarkko Kari
1995 B conf
Finite State Methods for Compression and Manipulation of Images.
Data Compression Conference
Karel Culík II, Jarkko Kari
1995 A* conf
Finite State Transformations of Images.
ICALP
Karel Culík II, Jarkko Kari
1995 J jnl
Global Cellular Automata.
Complex Syst.
Karel Culík II
1995 J jnl
Iterative Weighted Finite Transductions.
Acta Informatica
Karel Culík II, Peter Rajcáni
1995 J jnl
Weighted Finite Transducers in Image Processing.
Discret. Appl. Math.
Karel Culík II, Ivan Fris
1994 J jnl
Finite Automata Computing Real Functions.
SIAM J. Comput.
Karel Culík II, Juhani Karhumäki
1994 J jnl
Image-Data Compression Using Edge-Optimizing Algorithm for WFA Inference.
Inf. Process. Manag.
Karel Culík II, Jarkko Kari
1994 J jnl
Iterative Devices Generating Infinite Words.
Int. J. Found. Comput. Sci.
Karel Culík II, Juhani Karhumäki
1994 J jnl
On the Power of L-Systems in Image Generation.
Acta Informatica
Karel Culík II, Jarkko Kari
1994 — conf
Parallel Pattern Generation with One-Way Communications.
Results and Trends in Theoretical Computer Science
Karel Culík II, Jarkko Kari
1993 J jnl
Affine automata and related techniques for generation of complex images.
Theor. Comput. Sci.
Karel Culík II, Simant Dube
1993 J jnl
Balancing order and chaos in image generation.
Comput. Graph.
Karel Culík II, Simant Dube
1993 B conf
Efficient Compression of Wavelet Coefficients for Smooth and Fractal-like Data.
Data Compression Conference
Karel Culík II, Simant Dube, Peter Rajcáni
1993 A conf
Efficient Compression of Wavelet Coefficients for Smooth and Fractal-like Data.
STACS
Karel Culík II, Simant Dube
1993 J jnl
Encoding Images as Words and Languages.
Int. J. Algebra Comput.
Karel Culík II, Simant Dube
1993 B conf
Image Compression Using Weighted Finite Automata.
MFCS
Karel Culík II, Jarkko Kari
1993 J jnl
Image compression using weighted finite automata.
Comput. Graph.
Karel Culík II, Jarkko Kari
1993 J jnl
L-Systems and Mutually Recursive Function Systems.
Acta Informatica
Karel Culík II, Simant Dube
1993 J jnl
Mechanisms for Pattern Generation.
Complex Syst.
Karel Culík II, Jarkko Kari
1993 C conf
On the Power of L-Systems in Image Generation.
Developments in Language Theory
Karel Culík II, Jarkko Kari
1993 J jnl
Parametrized Recurrent Systems for Image Generation.
Inf. Process. Lett.
Karel Culík II, Jarkko Kari
1993 J jnl
Rational and Affine Expressions for Image Description.
Discret. Appl. Math.
Karel Culík II, Simant Dube
1992 A conf
Iterative Devices Generating Infinite Words.
STACS
Karel Culík II, Juhani Karhumäki
1991 J jnl
An Efficient Solution of the Firing Mob Problem.
Theor. Comput. Sci.
Karel Culík II, Simant Dube
1991 A* conf
Balancing Order and Chaos in Image Generation (Extended Abstract).
ICALP
Karel Culík II, Simant Dube
1991 J jnl
Cellular automata, omegaomega-regular sets, and sofic systems.
Discret. Appl. Math.
Karel Culík II, Sheng Yu
1991 — conf
New Methods for Image Generation and Compression.
New Results and New Trends in Computer Science
Karel Culík II, Simant Dube
1991 J jnl
Splicing semigroups of dominoes and DNA.
Discret. Appl. Math.
Karel Culík II, Tero Harju
1990 B conf
Affine Automata: A Technique to Generate Complex Images.
MFCS
Karel Culík II, Simant Dube
1990 — conf
Automata-Theoretic Techniques for Image Generation and Compression.
FSTTCS
Karel Culík II, Simant Dube
1990 J jnl
Loops in automata and HDTOL relations.
RAIRO Theor. Informatics Appl.
Karel Culík II, Juhani Karhumäki
1990 — conf
Methods for Generating Deterministic Fractals and Image Compression.
IMYCS
Karel Culík II, Simant Dube
1990 J jnl
New Techniques for Proving the Decidability of Equivalence Problems.
Theor. Comput. Sci.
Karel Culík II
1989 — ch.
A note on HDTOL Languages and the Equivalence of Deterministic Pushdown Transducers.
A Perspective in Theoretical Computer Science
Karel Culík II, Juhani Karhumäki
1989 A* conf
Dominoes and the Regularity of DNS Splicing Languages.
ICALP
Karel Culík II, Tero Harju
1989 J jnl
Fractal and Recurrent Behavior of Cellular Automata.
Complex Syst.
Karel Culík II, Simant Dube
1989 J jnl
HDTOL Matching of Computations of Multitape Automata.
Acta Informatica
Karel Culík II, Juhani Karhumäki
1989 A conf
On the Equivalence Problem for Deterministic Multitape Automata and Transducers.
STACS
Karel Culík II, Juhani Karhumäki
1989 J jnl
On the Limit Sets of Cellular Automata.
SIAM J. Comput.
Karel Culík II, Jan K. Pachl, Sheng Yu
1989 J jnl
Variations of the Firing Squad Problem and Applications.
Inf. Process. Lett.
Karel Culík II
1988 A* conf
New Techniques for Proving the Decidability of Equivalence Problems.
ICALP
Karel Culík II
1988 J jnl
On Totalistic Systolic Networks.
Inf. Process. Lett.
Karel Culík II, Juhani Karhumäki
1988 J jnl
Undecidability of CA Classification Schemes.
Complex Syst.
Karel Culík II, Sheng Yu
1987 J jnl
A Simple Universal Cellular Automaton and its One-Way and Totalistic Version.
Complex Syst.
Jürgen Albert, Karel Culík II
1987 J jnl
On Invertible Cellular Automata.
Complex Syst.
Karel Culík II
1987 J jnl
The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDT0L Languages) is Decidable.
SIAM J. Comput.
Karel Culík II, Juhani Karhumäki
1987 — conf
The Equivalence Problem for n-Tape Finite Automata with Simple Cycles.
FSTTCS
Karel Culík II, Matti Linna
1986 J jnl
A Note on the Equivalence Problem of Rational Formal Power Series.
Inf. Process. Lett.
Karel Culík II, Juhani Karhumäki
1986 J jnl
Real-Time, Pseudo Real-Time, and Linear-Time ITA.
Theor. Comput. Sci.
Karel Culík II, Sheng Yu
1986 J jnl
Synchronizable Deterministic Pushdown Automata and the Decidability of their Equivalence.
Acta Informatica
Karel Culík II, Juhani Karhumäki
1986 J jnl
Systolic Trellis Automata: Stability, Decidability and Complexity
Inf. Control.
Karel Culík II, Jozef Gruska, Arto Salomaa
1986 J jnl
The Equivalence of Finite Valued Transducers (On HDT0L Languages) is Decidable.
Theor. Comput. Sci.
Karel Culík II, Juhani Karhumäki
1986 B conf
The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable.
MFCS
Karel Culík II, Juhani Karhumäki
1985 J jnl
Decision problems solved with the help of the Ehrenfeucht conjecture.
Bull. EATCS
Karel Culík II, Juhani Karhumäki
1985 J jnl
Topological Transformations as a Tool in the Design of Systolic Networks.
Theor. Comput. Sci.
Karel Culík II, Ivan Fris
1985 B conf
Translation of Systolic Algorithms between Systems of Different Topology.
ICPP
Karel Culík II, Sheng Yu
1984 J jnl
Context-Free Complexity of Finite Languages.
Theor. Comput. Sci.
Walter Bucher, Hermann A. Maurer, Karel Culík II
1984 J jnl
Iterative Tree Automata.
Theor. Comput. Sci.
Karel Culík II, Sheng Yu
1984 A conf
On Extendibility of Unavoidable Sets.
STACS
Christian Choffrut, Karel Culík II
1984 J jnl
On Real Time and Linear Time Cellular Automata.
RAIRO Theor. Informatics Appl.
Walter Bucher, Karel Culík II
1984 J jnl
On Real-Time Cellular Automata and Trellis Automata.
Acta Informatica
Christian Choffrut, Karel Culík II
1984 J jnl
On extendibility of unavoidable sets.
Discret. Appl. Math.
Christian Choffrut, Karel Culík II
1984 J jnl
Systolic Tree Acceptors.
RAIRO Theor. Informatics Appl.
Karel Culík II, Arto Salomaa, Derick Wood
1984 J jnl
The omega-Sequence Problem for DOL Systems Is Decidable.
J. ACM
Karel Culík II, Tero Harju
1983 J jnl
Ambiguity and Decision Problems Concerning Number Systems
Inf. Control.
Karel Culík II, Arto Salomaa
1983 A* conf
Ambiguity and Decision Problems Concerning Number Systems.
ICALP
Karel Culík II, Arto Salomaa
1983 J jnl
Folding of the Plane and the Design of Systolic Arrays.
Inf. Process. Lett.
Christian Choffrut, Karel Culík II
1983 A conf
Logic versus mathematics in computer science education.
SIGCSE
Karel Culík II, Mateen M. Rizki
1983 J jnl
On a Family of L Languages Resulting from Systolic Tree Automata.
Theor. Comput. Sci.
Karel Culík II, Jozef Gruska, Arto Salomaa
1983 J jnl
On the Ehrenfeucht Conjecture for DOL Languages.
RAIRO Theor. Informatics Appl.
Karel Culík II, Juhani Karhumäki
1983 J jnl
Properties of Finite and Pushdown Transducers.
SIAM J. Comput.
Christian Choffrut, Karel Culík II
1983 J jnl
Systems of equations over a free monoid and Ehrenfeucht's conjecture.
Discret. Math.
Karel Culík II, Juhani Karhumäki
1983 B conf
Two Way Finite State Generators.
FCT
Karel Culík II, Emo Welzl
1982 J jnl
A Note on Some Tree Similarity Measures.
Inf. Process. Lett.
Karel Culík II, Derick Wood
1982 J jnl
A homomorphic characterization of regular languages.
Discret. Appl. Math.
Karel Culík II, Faith E. Fich, Arto Salomaa
1982 J jnl
Dominoes Over a Free Monoid.
Theor. Comput. Sci.
Karel Culík II, Tero Harju
1982 A* conf
Folding and Unrolling Systolic Arrays (Preliminary Version).
PODC
Karel Culík II, Jan K. Pachl
1982 J jnl
On Infinite Words Obtained by Iterating Morphisms.
Theor. Comput. Sci.
Karel Culík II, Arto Salomaa
1982 A* conf
On Test Sets and the Ehrenfeucht Conjecture.
ICALP
Karel Culík II
1982 J jnl
Systolic Automata for VLSI on Balanced Trees.
Acta Informatica
Karel Culík II, Jozef Gruska, Arto Salomaa
1982 J jnl
Test Sets for Context Free Languages and Algebraic Systems of Equations over a Free Monoid
Inf. Control.
Jürgen Albert, Karel Culík II, Juhani Karhumäki
1982 J jnl
Tree Correspondence Problems.
J. Comput. Syst. Sci.
Jürgen Albert, Karel Culík II
1981 J jnl
A Note on Recurrent Words
Inf. Control.
Karel Culík II, Derick Wood
1981 J jnl
Concise Description of Finite Languages.
Theor. Comput. Sci.
Walter Bucher, Hermann A. Maurer, Karel Culík II, Detlef Wotschke
1981 J jnl
Dense Multiway Trees.
ACM Trans. Database Syst.
Karel Culík II, Thomas Ottmann, Derick Wood
1981 J jnl
Equivalence Problems for Mappings on Infinite Strings
Inf. Control.
Karel Culík II, Jan K. Pachl
1981 A* conf
The omega-Sequence Equivalence Problem for DOL Systems Is Decidable
STOC
Karel Culík II, Tero Harju
1980 J jnl
On the Equality Sets for Homomorphisms on Free Monoids with Two Generators.
RAIRO Theor. Informatics Appl.
Karel Culík II, Juhani Karhumäki
1980 J jnl
Test Sets and Checking Words for Homomorphism Equivalence.
J. Comput. Syst. Sci.
Karel Culík II, Arto Salomaa
1980 J jnl
Test Sets for Homomorphism Equivalence on Context Free Languages
Inf. Control.
Jürgen Albert, Karel Culík II
1980 A* conf
Test Sets for Homomorphism Equivalence on Context Free Languages.
ICALP
Jürgen Albert, Karel Culík II
1979 J jnl
A Mathematical Investigation of Propagating Graph 0L Systems
Inf. Control.
Karel Culík II, Derick Wood
1979 J jnl
A Purely Homomorphic Characterization of Recursively Enumerable Sets.
J. ACM
Karel Culík II
1979 J jnl
Doubly deterministic tabled OL systems.
Int. J. Parallel Program.
Karel Culík II, Derek Wood
1979 J jnl
Interactive L Systems with Almost Interactionless Behaviour
Inf. Control.
Karel Culík II, Juhani Karhumäki
1979 B conf
Interactive L Systems with Almost Interactionless Behaviour.
MFCS
Karel Culík II, Juhani Karhumäki
1979 J jnl
On simple representations of language families.
RAIRO Theor. Informatics Appl.
Karel Culík II, Hermann A. Maurer
1979 A* conf
On the Homomorphic Characterizations of Families of Languages.
ICALP
Karel Culík II
1979 J jnl
Secure Information Storage and Retrieval Using New Results in Cryptography.
Inf. Process. Lett.
Karel Culík II, Hermann A. Maurer
1979 J jnl
Some Decidability Results About Regular and Pushdown Translations.
Inf. Process. Lett.
Karel Culík II
1978 J jnl
Isomorphism, Form Equivalence and Sequence Equivalence of PD0L Forms.
Theor. Comput. Sci.
Karel Culík II, Hermann A. Maurer, Thomas Ottmann, Keijo Ruohonen, Arto Salomaa
1978 J jnl
On Two-Symbol Complete E0L Forms.
Theor. Comput. Sci.
Karel Culík II, Hermann A. Maurer, Thomas Ottmann
1978 J jnl
On the Decidability of Homomorphism Equivalence for Languages.
J. Comput. Syst. Sci.
Karel Culík II, Arto Salomaa
1978 J jnl
Propagating Chain-Free Normal Forms for EOL Systems
Inf. Control.
Karel Culík II, Hermann A. Maurer
1978 J jnl
Speed-varying
Inf. Sci.
Karel Culík II, Derick Wood
1978 J jnl
The Decidability of v-Local Catenativity and of Other Properties of D0L Systems.
Inf. Process. Lett.
Karel Culík II
1978 J jnl
The Ultimate Equivalence Problem for DOL Systems.
Acta Informatica
Karel Culík II
1977 J jnl
The Decidability of the Equivalence Problem for DOL-Systems
Inf. Control.
Karel Culík II, Ivan Fris
1977 A* conf
The Sequence Equivalence Problem for D0L Systems is Decidable.
ICALP
Karel Culík II, Ivan Fris
1977 J jnl
Tree controlled grammars.
Computing
Karel Culík II, Hermann A. Maurer
1976 J jnl
On the Decidability of the Sequence Equivalence Problem for D0L-Systems.
Theor. Comput. Sci.
Karel Culík II
1975 — conf
Time Complexity of Recognition and Parsing of E0L-Languages.
Automata, Languages, Development
Jaroslav Opatrny, Karel Culík II
1974 — conf
Context in Parallel Rewriting.
L Systems
Karel Culík II, Jaroslav Opatrny
1974 A* conf
Parallel Rewriting Systems on terms.
ICALP
Karel Culík II, T. S. E. Maibaum
1974 — conf
Structured 0L-Systems.
L Systems
Karel Culík II
1973 J jnl
LR-Regular Grammars - an Extension of LR(k) Grammars.
J. Comput. Syst. Sci.
Karel Culík II, Rina S. Cohen
1971 J jnl
Abstract Families of Relations.
J. Comput. Syst. Sci.
Karel Culík II
1971 J jnl
Classification of Noncounting Events.
J. Comput. Syst. Sci.
Janusz A. Brzozowski, Karel Culík II, Armen Gabrielian
1971 — conf
LR-Regular Grammars-An Extension of LR(k) Grammars
SWAT
Rina S. Cohen, Karel Culík II
1970 J jnl
n-ary grammars and the description of mapping of languages.
Kybernetika
Karel Culík II
1968 J jnl
Contribution to deterministic top-down analysis of context-free languages.
Kybernetika
Karel Culík II
1967 J jnl
Relations defined by n-tape automata.
Kybernetika
Karel Culík II
1967 J jnl
Sequential machines with several input and output tapes.
Kybernetika
Karel Culík II