The following pages link to Karel II Culik (Q582130):
Displaying 50 items.
- HDTOL matching of computations of multitape automata (Q582131) (← links)
- Affine automata and related techniques for generation of complex images (Q685366) (← links)
- Speed-varying OL systems (Q754656) (← links)
- (Q786544) (redirect page) (← links)
- Systems of equations over a free monoid and Ehrenfeucht's conjecture (Q786545) (← links)
- Folding of the plane and the design of systolic arrays (Q788490) (← links)
- On real-time cellular automata and trellis automata (Q790615) (← links)
- Context-free complexity of finite languages (Q792097) (← links)
- Iterative tree automata (Q796998) (← links)
- On a family of L languages resulting from systolic tree automata (Q800102) (← links)
- Computation theoretic aspects of cellular automata (Q807035) (← links)
- Formal languages and global cellular automaton behavior (Q807036) (← links)
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- Topological transformations as a tool in the design of systolic networks (Q1069704) (← links)
- A note on the equivalence problem of rational formal power series (Q1087021) (← links)
- Real-time, pseudo real-time, and linear-time ITA (Q1089799) (← links)
- The equivalence of finite valued transducers (on HDT0L languages) is decidable (Q1090467) (← links)
- On extendibility of unavoidable sets (Q1094146) (← links)
- On totalistic systolic networks (Q1108796) (← links)
- Variations of the firing squad problem and applications (Q1116339) (← links)
- An aperiodic set of 13 Wang tiles (Q1126300) (← links)
- Test sets and checking words for homomorphism equivalence (Q1148122) (← links)
- Concise description of finite languages (Q1157179) (← links)
- Tree correspondence problems (Q1161310) (← links)
- A homomorphic characterization of regular languages (Q1162364) (← links)
- A note on some tree similarity measures (Q1166933) (← links)
- On infinite words obtained by iterating morphisms (Q1168084) (← links)
- Systolic automata for VLSI on balanced trees (Q1168737) (← links)
- Splicing semigroups of dominoes and DNA (Q1175793) (← links)
- Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems (Q1179180) (← links)
- An efficient solution of the firing mob problem (Q1183587) (← links)
- Rational and affine expressions for image description (Q1208468) (← links)
- On the decidability of the sequence equivalence problem for DOL-systems (Q1235985) (← links)
- Tree controlled grammars (Q1240570) (← links)
- Isomorphism, form equivalence and sequence equivalence of PDOL forms (Q1242695) (← links)
- The decidability of v-local catenativity and of other properties of DOL systems (Q1243142) (← links)
- On two-symbol complete EOL forms (Q1243143) (← links)
- The ultimate equivalence problem for DOL systems (Q1249437) (← links)
- On the decidability of homomorphism equivalence for languages (Q1251076) (← links)
- Some decidability results about regular and pushdown translations (Q1253937) (← links)
- Secure information storage and retrieval using new results in cryptography (Q1254858) (← links)
- \(L\)-systems and mutually recursive function systems (Q1323340) (← links)
- Parametrized recurrent systems for image generation (Q1334624) (← links)
- On the power of L-systems in image generation (Q1342508) (← links)
- Computational fractal geometry with WFA (Q1357812) (← links)
- Implementing Daubechies wavelet transform with weighted finite automata (Q1359368) (← links)
- Weighted finite transducers in image processing (Q1804886) (← links)
- Synchronizable deterministic pushdown automata and the decidability of their equivalence (Q1822521) (← links)
- Dominoes over a free monoid (Q1838319) (← links)
- Iterative weighted finite transductions (Q1902304) (← links)
