Karel II Culik

From MaRDI portal
Person:582130

Available identifiers

zbMath Open culik.karel-iiWikidataQ102244074 ScholiaQ102244074MaRDI QIDQ582130

List of research outcomes

PublicationDate of PublicationType
Parallel pattern generation with one-way communications2024-01-29Paper
Iterative devices generating infinite words2022-08-18Paper
On the equivalence problem for deterministic multitape automata and transducers2022-08-16Paper
Finite state transformations of images2019-01-10Paper
An aperiodic set of Wang cubes2017-11-16Paper
Aspects of Molecular Computing2009-05-14Paper
A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM2005-06-22Paper
https://portal.mardi4nfdi.de/entity/Q47379052004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44741502004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q45203062001-02-26Paper
https://portal.mardi4nfdi.de/entity/Q49422602000-07-20Paper
https://portal.mardi4nfdi.de/entity/Q43206462000-06-21Paper
https://portal.mardi4nfdi.de/entity/Q49411702000-02-29Paper
ITERATIVE DEVICES GENERATING INFINITE WORDS1998-11-02Paper
https://portal.mardi4nfdi.de/entity/Q43710181998-02-22Paper
Computational fractal geometry with WFA1997-12-14Paper
Implementing Daubechies wavelet transform with weighted finite automata1997-11-18Paper
https://portal.mardi4nfdi.de/entity/Q43479541997-11-09Paper
https://portal.mardi4nfdi.de/entity/Q43584541997-09-29Paper
https://portal.mardi4nfdi.de/entity/Q43323671997-02-13Paper
An aperiodic set of 13 Wang tiles1997-01-14Paper
https://portal.mardi4nfdi.de/entity/Q48904441996-08-25Paper
Iterative weighted finite transductions1995-12-14Paper
On the power of L-systems in image generation1995-08-27Paper
Weighted finite transducers in image processing1995-05-17Paper
Finite Automata Computing Real Functions1994-10-17Paper
Parametrized recurrent systems for image generation1994-09-25Paper
\(L\)-systems and mutually recursive function systems1994-06-02Paper
https://portal.mardi4nfdi.de/entity/Q42815361994-04-07Paper
ENCODING IMAGES AS WORDS AND LANGUAGES1993-11-01Paper
Affine automata and related techniques for generation of complex images1993-10-28Paper
https://portal.mardi4nfdi.de/entity/Q40365971993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40367601993-05-18Paper
Rational and affine expressions for image description1993-05-16Paper
The topological entropy of cellular automata is uncomputable1993-02-18Paper
An efficient solution of the firing mob problem1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39792571992-06-26Paper
Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems1992-06-26Paper
Splicing semigroups of dominoes and DNA1992-06-25Paper
Computation theoretic aspects of cellular automata1990-01-01Paper
Formal languages and global cellular automaton behavior1990-01-01Paper
New techniques for proving the decidability of equivalence problem1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33552591990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33598031990-01-01Paper
Loops in automata and HDTOL relations1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42050871989-01-01Paper
HDTOL matching of computations of multitape automata1989-01-01Paper
Variations of the firing squad problem and applications1989-01-01Paper
On the Limit Sets of Cellular Automata1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33582491989-01-01Paper
On totalistic systolic networks1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37937511988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38059071988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38133161988-01-01Paper
The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDTOL Languages) is Decidable1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37716221987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37766651987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37828191987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37890921987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38026291987-01-01Paper
Fault-tolerant schemes for some systolic systems1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38059061987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47282631986-01-01Paper
A note on the equivalence problem of rational formal power series1986-01-01Paper
Real-time, pseudo real-time, and linear-time ITA1986-01-01Paper
The equivalence of finite valued transducers (on HDT0L languages) is decidable1986-01-01Paper
Synchronizable deterministic pushdown automata and the decidability of their equivalence1986-01-01Paper
Systolic trellis automata: Stability, decidability and complexity1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37117701986-01-01Paper
Iterative tree arrays with logarithmic depth1986-01-01Paper
Topological transformations as a tool in the design of systolic networks1985-01-01Paper
On real-time cellular automata and trellis automata1984-01-01Paper
Context-free complexity of finite languages1984-01-01Paper
Iterative tree automata1984-01-01Paper
On extendibility of unavoidable sets1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33392931984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33434641984-01-01Paper
Systolic trellis automatata †1984-01-01Paper
Systolic trellis automatat†1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36877241984-01-01Paper
The ω sequence problem for DOL systems is decidable1984-01-01Paper
Transductions and the parallel generation of languages1983-01-01Paper
Systems of equations over a free monoid and Ehrenfeucht's conjecture1983-01-01Paper
Folding of the plane and the design of systolic arrays1983-01-01Paper
On a family of L languages resulting from systolic tree automata1983-01-01Paper
Systolic automata for VLSI on balanced trees1983-01-01Paper
Programmable finite automata for VLSI†1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33090901983-01-01Paper
Ambiguity and decision problems concerning number systems1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33340931983-01-01Paper
Properties of Finite and Pushdown Transducers1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37055101983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39456041982-01-01Paper
Tree correspondence problems1982-01-01Paper
A homomorphic characterization of regular languages1982-01-01Paper
A note on some tree similarity measures1982-01-01Paper
On infinite words obtained by iterating morphisms1982-01-01Paper
Dominoes over a free monoid1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33268721982-01-01Paper
Test sets for context free languages and algebraic systems of equations over a free monoid1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39408501982-01-01Paper
A note on recurrent words1981-01-01Paper
Concise description of finite languages1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32190951981-01-01Paper
Dense multiway trees1981-01-01Paper
Equivalence problems for mappings on infinite strings1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39337761981-01-01Paper
Test sets and checking words for homomorphism equivalence1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38868961980-01-01Paper
A homomorphic characterization of time and space complexity classes of languages†1980-01-01Paper
Test sets for homomorphism equivalence on context free languages1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39017011980-01-01Paper
GROWING CELLULAR SYSTEMS: GENERATION OF GRAPHS BY PARALLEL REWRITING1979-01-01Paper
A Purely Homomorphic Characterization of Recursively Enumerable Sets1979-01-01Paper
Homomorphism equivalence on etol languages†1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41995501979-01-01Paper
Some decidability results about regular and pushdown translations1979-01-01Paper
Secure information storage and retrieval using new results in cryptography1979-01-01Paper
A mathematical investigation of propagating graph 0L systems1979-01-01Paper
Interactive L systems with almost interactionless behaviour1979-01-01Paper
Doubly deterministic tabled OL systems1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38703261979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39064441979-01-01Paper
Propagating chain-free normal forms for EOL systems1978-01-01Paper
String representations of graphs1978-01-01Paper
Speed-varying OL systems1978-01-01Paper
Isomorphism, form equivalence and sequence equivalence of PDOL forms1978-01-01Paper
The decidability of v-local catenativity and of other properties of DOL systems1978-01-01Paper
On two-symbol complete EOL forms1978-01-01Paper
The ultimate equivalence problem for DOL systems1978-01-01Paper
On the decidability of homomorphism equivalence for languages1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41243381977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41386431977-01-01Paper
The decidability of the equivalence problem for DOL-systems1977-01-01Paper
On the decidability of the sequence equivalence problem for DOL-systems1977-01-01Paper
Tree controlled grammars1977-01-01Paper
PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT†1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40650551975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40958951975-01-01Paper
On some families of languages related to developmental systems1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40486141974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47754901974-01-01Paper
A model for the formal definition of programming languages1973-01-01Paper
LR-regular grammars - an extension of LR(k) grammars1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56336611971-01-01Paper
Abstract families of relations1971-01-01Paper
Classification of noncounting events1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55900631970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55564381968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55286491967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55376191967-01-01Paper
Construction of the automaton mapping1965-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Karel II Culik