EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 28 / No 3-4 (1994) RAIRO-Theor. Inf. Appl., 28 3-4 (1994) 425-430 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 28, Number 3-4, 1994
Special issue for Professor Karel Culik II : 60 th birthday
Page(s) 425 - 430
DOI https://doi.org/10.1051/ita/1994283-404251
Published online 03 February 2017
  1. 1. K. CULIK II, Decomposition of Automata and Note on Their Analysis (in Czech), Aplikace Matematiky, 1963, 8, pp. 292-301. [EuDML: 14271] [MR: 157836] [Zbl: 0192.07604] [Google Scholar]
  2. 2. K. CULIK II, Construction of the Automaton Mapping (in Russian), Aplikace Matematiky, 1965, 10, pp. 459-468. [EuDML: 14380] [MR: 188018] [Zbl: 0142.24903] [Google Scholar]
  3. 3. K. CULIK II, Relation Represented by n-tape Automata (in Czech), Kybernetika, 1967, 3, pp. 321-345. [Zbl: 0149.24903] [Google Scholar]
  4. 4. K. CULIK II, Sequential Machines with Several Input and Output Tapes, Kybernetika, 1967, 3, pp. 540-559. [EuDML: 28169] [Zbl: 0155.02001] [Google Scholar]
  5. 5. J. CULIK, K. CULIK II and J. VOGEL, SIS - Programming Language for Simulation, Information Processing Machines, 1968, 14, pp. 119-152. [Google Scholar]
  6. 6. K. CULIK II, Languages Represented by n-tape Automata, Information Processing Machines, 1968, 14, pp. 83-100. [MR: 255310] [Google Scholar]
  7. 7. K. CULIK II, A Contribution to Top-down Analysis of Context-Free Languages, Kybernetika, 1968, 4, pp. 422-431. [EuDML: 27498] [MR: 255327] [Zbl: 0169.31401] [Google Scholar]
  8. 8. K. CULIK II, N-ary Grammars and the Description of Mapping of Languages, Kybernetika, 1970, 6, pp. 99-117. [EuDML: 28059] [MR: 272563] [Zbl: 0194.31602] [Google Scholar]
  9. 9. J. A. BRZOZOWSKI, K. CULIK II and A. GABRIELIAN, Classification of Non-Counting Events, JCSS, 1971, 5, pp. 41-53. [MR: 286578] [Zbl: 0241.94050] [Google Scholar]
  10. 10. K. CULIK II and C. J. W. MOREY, Formal Schemes for Language Translations, International J. of Comp. Math. (Section A), 1971, 3, pp. 17-48. [MR: 301986] [Zbl: 0226.68034] [Google Scholar]
  11. 11. K. CULIK II, Abstract Families of Relations, JCSS, 1971, 5, pp. 596-605. [MR: 305661] [Zbl: 0226.68033] [Google Scholar]
  12. 12. K. CULIK II and R. COHEN, LR-regular Grammars - An Extension of LR (k) Grammars, JCSS, 1973, 7, pp. 66-96. [MR: 319413] [Zbl: 0253.68014] [Google Scholar]
  13. 13. K. CULIK II, A Model for the Formal Definition of Programming Languages, International J. of Computer Math. (Section A), 1973, 3, pp. 315-345. [Zbl: 0273.68052] [Google Scholar]
  14. 14. K. CULIK II, On Some Families of Languages Related to Development Systems, International J. of Computer Math., (Section A), 1974, 4, pp. 31-42. [MR: 363009] [Zbl: 0294.68025] [Google Scholar]
  15. 15. K. CULIK II and J. OPATRNY, Literal Homomorphisms of OL-Languages, International J. of Comp. Math., (Section A), 1974, 4, pp. 247-267. [Zbl: 0327.68071] [Google Scholar]
  16. 16. K. CULIK II and J. OPATRNY, Macro OL-Systems, International J. of Comp. Math. (Section A), 1975, 4, pp. 327-342. [Zbl: 0309.68064] [Google Scholar]
  17. 17. K. CULIK II and A. LINDENMAYER, Parallel Rewriting on Graphs and Multidimensional Development, Int. Journal of General Systems, 1976, 3, pp. 53-66. [Zbl: 0332.68054] [Google Scholar]
  18. 18. K. CULIK II, On the Decidability of the Sequence Equivalence Problem for DOL-systems, Theoretical Computer Science, 1977, 3, pp. 75-84. [Zbl: 0352.68103] [Google Scholar]
  19. 19. K. CULIK II and I. FRIS, The Decidability of the Equivalence Problem for DOL-systems, Information and Control, 1977, 35, pp. 20-39. [Zbl: 0365.68074] [Google Scholar]
  20. 20. K. CULIK II and H. A. Maurer, Tree Controlled Grammars, Computing, 1977, 19, pp. 129-139. [MR: 464718] [Zbl: 0363.68108] [Google Scholar]
  21. 21. K. CULIK II and H. A. MAURER, Linearizing Selector-graphs and Applications Thereof, Angewandte Informatik, 1977, 9, pp. 386-394. [Zbl: 0363.94033] [Google Scholar]
  22. 22. K. CULIK II, The Decidability of v-Local Catenativity and of Other Properties of DOL Systems, Information Processing Letters, 1978, 7, pp. 33-35. [MR: 464720] [Zbl: 0369.68044] [Google Scholar]
  23. 23. K. CULIK II and H. A. MAURER, String Representation of Graphs, Int. J. of Comp. Math. (Section A), 1978, 6, pp. 273-301. [MR: 502288] [Zbl: 0399.05046] [Google Scholar]
  24. 24. K. CULIK II and H. A. MAURER, Propagating Chain-free Normal Forms for EOL Systems, Information and Control, 1978, 36, pp. 309-319. [MR: 468336] [Zbl: 0368.68071] [Google Scholar]
  25. 25. K. CULIK II, H. A. MAURER and Th. OTTMANN, On Two-symbol Complete EOL Forms, Theoretical Computer Science, 1978, 6, pp. 69-92. [MR: 464719] [Zbl: 0369.68046] [Google Scholar]
  26. 26. K. CULIK II, H. A. MAURER, Th. OTTMANN, K. RUOHONEN and A. SALOMAA, Isomorphism, Form Equivalence and Sequence Equivalence of PDOL Forms, Theoretical Computer Science, 1978, 6, pp. 143-173. [MR: 471454] [Zbl: 0368.68072] [Google Scholar]
  27. 27. K. CULIK II, The Ultimate Equivalence Problem for DOL Systems, Acta Informatica, 1978, 10, pp. 69-84. [MR: 495230] [Zbl: 0385.68060] [Google Scholar]
  28. 28. K. CULIK II and D. WOOD, Speed-Varying OL-Systems, Information Sciences, 1978, 14, pp. 161-170. [MR: 538386] [Zbl: 0416.68069] [Google Scholar]
  29. 29. K. CULIK II and A. SALOMAA, On the Decidability of Homomorphism equivalence for Languages, JCCS, 1978, 17, pp. 163-175. [MR: 514269] [Zbl: 0389.68042] [Google Scholar]
  30. 30. K. CULIK II and D. WOOD, Double Deterministic Tabled OL Systems, Int. J. of Computer and Inf. Sciences, 1979, 8, pp. 335-347. [MR: 539877] [Zbl: 0426.68073] [Google Scholar]
  31. 31. K. CULIK II and A. LINDENMAYER, Growing Cellular Systems: Generation of Graphs by Parallel Rewriting, Int. J. General Systems, 1979, 5, pp. 45-55. [Zbl: 0392.92007] [Google Scholar]
  32. 32. K. CULIK II, A Purely Homomorphic Characterization of Recursively Enumerable Sets, JACM, 1979, 26, pp. 345-350. [MR: 528036] [Zbl: 0395.68076] [Google Scholar]
  33. 33. K. CULIK II, Some Decidability Results about Regular and Push Down Translations, Information Processing Letters, 1979, 8, pp. 5-8. [MR: 515503] [Zbl: 0397.68083] [Google Scholar]
  34. 34. K. CULIK II and J. L. RICHIER, Homomorphism Equivalence on ETOL Languages, Int. J. of Computer Math. (Section A), 1979, 7, pp. 43-51. [MR: 520282] [Zbl: 0401.68049] [Google Scholar]
  35. 35. K. CULIK II and D. WOOD, A Mathematical Investigation of Parallel Graph OL Systems, Inf. and Control, 1979, 43, pp. 50-82. [MR: 549264] [Zbl: 0415.68039] [Google Scholar]
  36. 36. K. CULIK II and H. A. MAURER, On Simple Representations of Language Families, RAIRO Informatique théorique, 1979, 13, pp. 241-250. [EuDML: 92102] [MR: 554685] [Zbl: 0432.68052] [Google Scholar]
  37. 37. K. CULIK II and H. A. MAURER, Secure Information Storage and Retrieval Using New Results in Cryptography, Inf. Processing Letters, 1979, 8, pp. 181-186. [MR: 529989] [Zbl: 0399.68094] [Google Scholar]
  38. 38. K. CULIK II and J. KARHUMAKI, Interactive L-systems with Almost Interactionless Behavior, Inf. and Control, 1979, 43, pp. 83-100. [MR: 549265] [Zbl: 0424.68044] [Google Scholar]
  39. 39. K. CULIK II and N. D. DIAMOND, A Homomorphic Characterization of Time and Space Complexity Classes of Languages, Int. J. of Computer Math. (Section A), 1980, 8, pp. 207-222. [MR: 585410] [Zbl: 0444.68035] [Google Scholar]
  40. 40. K. CULIK II and A. SALOMAA, Test Sets and Checking Words for Homomorphism Equivalence, JCSS, 1980, 20, pp. 379-395. [MR: 584866] [Zbl: 0451.68046] [Google Scholar]
  41. 41. K. CULIK II and J. KARHUMAKI, On the Equality Sets for Homomorphisms on Free Monoids with Two Generators, RAIRO Informatique théorique, 1980, 14, pp. 349-369. [EuDML: 92131] [MR: 607436] [Zbl: 0454.20048] [Google Scholar]
  42. 42. K. CULIK II and J. ALBERT, Test Sets for Homomorphism Equivalence on Context Free Languages, Inf. and Control, 1980, 45, pp. 273-284. [MR: 590851] [Zbl: 0453.68048] [Google Scholar]
  43. 43. K. CULIK II, Th. OTTMANN and D. WOOD, Dense Multiway Trees, ACM Transactions on Database Systems, 1981, 6, pp. 486-512. [MR: 629996] [Zbl: 0462.68035] [Google Scholar]
  44. 44. K. CULIK II, W. BUCHER, H. A. MAURER and D. WOTSCHKE, Concise Description of Finite Languages, Theoretical Computer Science, 1981, 14, pp. 227-246. [MR: 619000] [Zbl: 0469.68081] [Google Scholar]
  45. 45. K. CULIK II and J. PACHL, Equivalence Problems for Mappings on Infinite Strings, Inf. and Control, 1981, 49, pp. 52-63. [MR: 642476] [Zbl: 0472.68045] [Google Scholar]
  46. 46. K. CULIK II and D. WOOD, Note on Recurrent Words, Inf. and Control, 1981, 51, pp. 88-94. [MR: 686197] [Zbl: 0493.68079] [Google Scholar]
  47. 47. K. CULIK II, F. E. FICH and A. SALOMAA, A Homomorphic Characterization of Regular Languages, Applied Discrete Mathematics, 1982, 4, pp. 149-152. [MR: 677880] [Zbl: 0481.68069] [Google Scholar]
  48. 48. K. CULIK II and A. SALOMAA, On Infinite Words Obtained by iterating Morphisms, Theoretical Computer Science, 1982, 19, pp. 29-38. [MR: 664411] [Zbl: 0492.68059] [Google Scholar]
  49. 49. K. CULIK II and T. HARJU, Dominoes Over a Free Monoid, Theoretical Computer Science, 1982, 18, pp. 279-300. [MR: 662674] [Zbl: 0509.68068] [Google Scholar]
  50. 50. J. ALBERT and K. CULIK, Tree Correspondance Problems, JCSS, 1982, 24, pp. 167-179. [MR: 661647] [Zbl: 0478.68089] [Google Scholar]
  51. 51. J. ALBERT, K. CULIK II and J. KARHUMAKI, Test Sets for Context-Free Languages and Systems of Equations over a Free Monoid, Inf. and Control, 1982, 52, pp. 172-186. [MR: 701592] [Zbl: 0522.68064] [Google Scholar]
  52. 52. K. CULIK II and D. WOOD, A Note on Some Tree Similarity Measures, Information Processing Letters, 1982, 15, pp. 39-42. [MR: 678031] [Zbl: 0489.68058] [Google Scholar]
  53. 53. K. CULIK II and T. HEAD, Transductions and the Parallel Generation of Language, Inter. J. Comp. Math (Section A), 1983, 13, pp. 3-15. [MR: 698154] [Zbl: 0503.68057] [Google Scholar]
  54. 54. C. CHOFFRUT and K. CULIK II, Properties of Finite and Pushdown Transducers, SIAM J. on Comp., 1983, 12, pp. 300-315. [MR: 697162] [Zbl: 0512.68065] [Google Scholar]
  55. 55. K. CULIK II and J. KARHUMAKI, Systems of Equations over a Free Monoid and Ehrenfeucht Conjecture, Discrete Mathematics, 1983, 43, pp. 139-153. [MR: 685623] [Zbl: 0528.68057] [Google Scholar]
  56. 56. K. CULIK II, J. GRUSKA and A. SALOMAA, On a Family of L-Ianguages Resulting from Systolic Tree Automata, Theoretical Computer Science, 1983, 23, pp. 231-242. [MR: 702010] [Zbl: 0549.68081] [Google Scholar]
  57. 57. K. CULIK II, J. GRUSKA and A. SALOMAA, Systolic Automata for VLSI on Balanced Trees, Acta Informatica, 1983, 18, pp. 335-344. [MR: 691733] [Zbl: 0493.68054] [Google Scholar]
  58. 58. K. CULIK II and J. KARHUMAKI, On the Ehrenfeucht Conjecture for DOL Languages, RAIRO, Informatique théorique, 1983, 17, pp. 205-230. [EuDML: 92185] [MR: 743886] [Zbl: 0544.68050] [Google Scholar]
  59. 59. C. CHOFFRUT and K. CULIK II, Folding of the Plane and the Design of Systolic Arrays, Inform. Processing Letters, 1983, 17, pp. 149-153. [MR: 731137] [Zbl: 0531.68009] [Google Scholar]
  60. 60. K. CULIK II and A. SALOMAA, Ambiguity and Decision Problems Concerning Number Systems, Inf. and Control, 1983, 56, pp. 139-153. [MR: 735500] [Zbl: 0541.03006] [Google Scholar]
  61. 61. K. CULIK II and H. JURGENSEN, Programmable Finite Automata for VLSI, Int. J. Comp. Math. (Section A), 1983, 14, pp. 259-275. [MR: 727012] [Zbl: 0528.68035] [Google Scholar]
  62. 62. W. BUCHER, K. CULIK II and H. A. MAURER, Context-free Complexity of Finite Language, Theoretical Computer Science, 1984, 28, pp. 277-286. [MR: 742290] [Zbl: 0536.68065] [Google Scholar]
  63. 63. K. CULIK II and T. HARJU, The Omega-Sequence Equivalence Problem for DOL System is Decidable, JACM, 1984, 31, pp. 282-298. [MR: 819139] [Zbl: 0632.68078] [Google Scholar]
  64. 64. K. CULIK II, A. SALOMAA and D. WOOD, Systolic Tree Acceptors, RAIRO, Informatique théorique, 1984, 18, pp. 53-69. [EuDML: 92200] [MR: 750451] [Zbl: 0571.68043] [Google Scholar]
  65. 65. K. CULIK II, J. GRUSKA and A. SALOMAA, Systolic Trellis Automata, Part I, Inter. J. of Computer Math. (Section A), 1984, 15, pp. 195-212. [MR: 754266] [Zbl: 0571.68041] [Google Scholar]
  66. 66. K. CULIK II, J. GRUSKA and A. SALOMAA, Systolic Trellis Automata, Part II, Inter. J. of Computer Math. (Section A), 1984, 16, pp. 3-22. [MR: 757600] [Zbl: 0571.68042] [Google Scholar]
  67. 67. W. BUCHER, K. CULIK II, On Real Time and Linear Time Cellular Automata, RAIRO, Informatique théorique, 1984, 18, pp. 307-325. [EuDML: 92213] [MR: 775835] [Zbl: 0547.68050] [Google Scholar]
  68. 68. C. CHOFFRUT and K. CULIK II, On Extendibility of Unavoidable Sets, Discrete Mathematics, 1984, 9, pp. 125-137. [MR: 761597] [Zbl: 0629.68080] [Google Scholar]
  69. 69. K. CULIK II and SHENG YU, Iterative Tree Automata, Theoretical Computer Science, 1984, 32, pp. 227-247. [MR: 761344] [Zbl: 0544.68055] [Google Scholar]
  70. 70. C. CHOFFRUT and K. CULIK II, On Real-Time Cellular Automata and Trellis Automata, Acta Informatica, 1984, 21, pp. 393-407. [MR: 767316] [Zbl: 0534.68039] [Google Scholar]
  71. 71. K. CULIK II and I. FRIS, Topological Transformations as a Tool in The Design of Systolic Networks, Theoretical Computer Science, 1985, 37, pp. 183-216. [MR: 820944] [Zbl: 0584.68068] [Google Scholar]
  72. 72. K. CULIK II and J. KARHUMÄKI, Synchronizable Deterministic Pushdown Automata and the Decidability of Their Equivalence, Acta Informatica, 1986, 23, pp. 597-605. [MR: 858029] [Zbl: 0617.68075] [Google Scholar]
  73. 73. K. CULIK II, J. GRUSKA and A. SALOMAA, Systolic Trellis Automata: Stability, Decidability and Complexity, Information and Control, 1986, 71, pp. 218-230. [MR: 866961] [Zbl: 0626.68048] [Google Scholar]
  74. 74. K. CULIK II and J. KARHUMÄKI, A Note on the Equivalence Problem of Rotational Formal Power Series, Inform. Processing Letters, 1986, 23, pp. 29-31. [MR: 853623] [Zbl: 0609.68055] [Google Scholar]
  75. 75. K. CULIK II, O. H. IBARRA and SHENG YU, Iterative Tree Arrays with Logarithmic Depth, Intern. J. of Computer Math. (Section A), 1986, 20, pp. 187-204. [Zbl: 0655.68056] [Google Scholar]
  76. 76. K. CULIK II and SHENG YU, Real Time, Pseudo Real Time and Linear Time ITA, Theoretical Computer Science, 1986, 47, pp. 15-26. [MR: 871461] [Zbl: 0619.68050] [Google Scholar]
  77. 77. K. CULIK II and J. KARHUMÄKI, The Equivalence Problem of Finite-valued Finite Transducers (on HDTOL Languages) is Decidable, Theoretical Computer Science, 1986, 47, pp. 71-84. [MR: 871465] [Zbl: 0621.68049] [Google Scholar]
  78. 78. K. CULIK II and J. KARHUMÄKI, The Equivalence Problem for Single-Valued Two-Way Transducers is Decidable, SIAM J. on Comput., 1987, 16, pp. 221-230. [MR: 882528] [Zbl: 0632.68077] [Google Scholar]
  79. 79. K. CULIK II and SHENG YU, Fault-Tolerant Schemes for Some Systolic Systems, Intern. J. on Comp. Math. (Section A), 1987, 22, pp. 13-42. [Zbl: 0656.68055] [Google Scholar]
  80. 80. J. ALBERT and K. CULIK II, A Simple Universal Cellular Automaton and its One-Way and Totalistic Version, J. Complex Systems, 1987, 1, pp. 1-16. [MR: 891509] [Zbl: 0655.68065] [Google Scholar]
  81. 81. K. CULIK II, H. JÜRGENSEN and K. MAK, Systolic Tree Architecture for Some Standard Functions, Computers and Artificial Intelligence, 1987, 6, pp. 243-261. [Zbl: 0633.68043] [Google Scholar]
  82. 82. K. CULIK II and J. KARHUMÄKI, On Totalistic Systolic Networks, Inform. Processing Letters, 1987/88, 26, pp. 213-236. [MR: 920722] [Zbl: 0654.68058] [Google Scholar]
  83. 83. K. CULIK II, On Invertible Cellular Automata, Complex Systems, 1987, 1, pp. 1035-1044. [MR: 931401] [Zbl: 0657.68053] [Google Scholar]
  84. 84. K. CULIK II and S. YU, Undecidability of CA Classification Schemes, Complex Systems, 1988, 2, pp. 177-190. [MR: 941664] [Zbl: 0657.68054] [Google Scholar]
  85. 85. K. CULIK II, Variations of the Firing Squad Problem and Applications, Information Processing Letters, 1989, 30, pp. 153-157. [MR: 983761] [Zbl: 0665.68043] [Google Scholar]
  86. 86. K. CULIK II, J. PACHL and S. YU, On the Limit Sets of Cellular Automata, SIAM J. on Computing, 1989, 18, pp. 831-842. [MR: 1004801] [Zbl: 0691.68060] [Google Scholar]
  87. 87. K. CULIK II and J. KARHUMÄKI, HDTOL Matching of Computations of multitape automata, Acta Informatica, 1989, 27, pp. 179-191. [MR: 1031344] [Zbl: 0689.68103] [Google Scholar]
  88. 88. K. CULIK II and S. DUBE, Fractal and Recurrent Behavior of Cellular Automata, Complex Systems, 1989, 3, pp. 253-267. [MR: 1102354] [Zbl: 0732.68079] [Google Scholar]
  89. 89. K. CULIK II, New Techniques for Proving the Decidability of Equivalence Problems, Theoretical Computer Science, 1990, 71, pp. 29-45. [MR: 1050077] [Zbl: 0699.68092] [Google Scholar]
  90. 90. K. CULIK II, L. P. HURD and S. YU, Formal Languages and Global Cellular Automata Behavior, Physica D, 1990, 45, pp. 396-403. [MR: 1094884] [Zbl: 0729.68053] [Google Scholar]
  91. 91. K. CULIK II, L. P. HURD and S. YU, Computation Theoretic Aspect of Cellular Automata, Physica D, 1990, 45, pp. 357-378. [MR: 1094881] [Zbl: 0729.68052] [Google Scholar]
  92. 92. K. CULIK II and J. KARHUMÄKI, Loops in Automata and HDTOL Relations, RAIRO Informatique théorique, 1990, 24, pp. 327-336. [EuDML: 92361] [MR: 1079718] [Zbl: 0701.68079] [Google Scholar]
  93. 93. K. CULIK II and T. HARJU, Dominoes, Splicing Semigroups and DNA, Discrete Applied Mathematics, 1991, 31, pp. 261-277. [MR: 1110460] [Zbl: 0747.20035] [Google Scholar]
  94. 94. K. CULIK II and S. YU, Cellular Automate, ωω-Regular Sets, and Sofic Systems, Discrete Applied Mathematics, 1991, 32, pp. 85-102. [MR: 1120663] [Zbl: 0743.68085] [Google Scholar]
  95. 95. K. CULIK II and S. DUBE, An Efficient Solution to the Firing Mob Problem, Theor. Comp. Science, 1991, 91, pp. 57-69. [MR: 1142557] [Zbl: 0745.68025] [Google Scholar]
  96. 96. L. HURD, J. KARI and K. CULIK II, The Topological Entropy of Cellular Automata is Uncomputable. Ergodic Theory and Dynamical Systems, 1992, 12, pp. 255-265. [MR: 1176622] [Zbl: 0770.58017] [Google Scholar]
  97. 97. K. CULIK II and S. DUBE, Rational and Affine Expressions for Image Description, Discrete Applied Mathematics, 1993, 41, pp. 85-120. [MR: 1198549] [Zbl: 0784.68058] [Google Scholar]
  98. 98. K. CULIK and J. KARI, Image Compression Using Weighted Finite Automata. Computer and Graphics, vol. 17, 1993, 3, pp. 305-313. [MR: 1265078] [Google Scholar]
  99. 99. K. CULIK II and S. DUBE, L-systems and Mutually Recursive Function Systems, Acta Informatica, 1993, 30, pp. 279-302. [MR: 1227886] [Zbl: 0790.68056] [Google Scholar]
  100. 100. K. CULIK and S. DUBE, Affine Automata and Related Techniques for Generation of Complex Images. Theoretical Computer Science, 1993, 116, pp. 373-398. [MR: 1231951] [Zbl: 0779.68062] [Google Scholar]
  101. 101. K. CULIK II and S. DUBE, Balancing Order and Chaos in Image Generation, Computer and Graphics (to appear). [Zbl: 0769.68120] [Google Scholar]
  102. 102. K. CULIK II and S. DUBE, Encoding Images as Words and Languages. Int. J. of Algebra and Commutation (to appear). [MR: 1233222] [Zbl: 0777.68056] [Google Scholar]
  103. 103. K. CULIK II and J. KARHUMÄKI, Iterative Devices Generating Infinite words. Int. J. on Foundation of Computer Science (to appear). [Zbl: 0900.68337] [Google Scholar]
  104. 104. K. CULIK II and J. KARHUMÄKI, Finite Automata Computing Real Functions. SIAM J. on Computing (to appear). [MR: 1283575] [Zbl: 0820.68061] [Google Scholar]
  105. 105. K. CULIK II and I. FRIS, Weighted Finite Transducers in Image Processing. Discrete Applied Mathematics (to appear). Contributions to Books: [MR: 1326048] [Zbl: 0818.68145] [Google Scholar]
  106. 1. K. CULIK II and J. OPATRNY, Context in Parallel Rewriting, in L-systems, edited by G. Rozenberg and A. Salomaa, Lectures Notes in Computer Science, Springer-Verlag, 1974, 15, pp. 230-243. [MR: 408332] [Zbl: 0315.68066] [Google Scholar]
  107. 2. K. CULIK II, Structural OL Systems, in L-systems, edited by G. Rozenberg, A. Salomaa, Lectures Notes in Computer Science, 1974, 15, pp. 216-219. [MR: 408331] [Zbl: 0295.68060] [Google Scholar]
  108. 3. K. CULIK II and J. OPATRNY, Time Complexity of L-systems, in Automata, Languages, Development, edited by A. Lindenmayer and G. Rozenberg, North-Holland, Amsterdam, 1976, pp. 243-250. [MR: 464734] [Google Scholar]
  109. 4. K. CULIK II and Y. KOBUCHI, Simulation Relation of Dynamical Systems, in Progress in Cybernetics and Systems Research, edited by R. Trappl, Hemisphere Publi. Corp., Washington, D. C., 1980, pp. 251-255. [Zbl: 0482.68049] [Google Scholar]
  110. 5. K. CULIK II and M. FARAH, Linked Forest Manipulating Systems, a Tool for Computational Semantics, in Advances Information Systems Science, Vol. 8, edited by T. Tou, Plenum Publ., 1981, pp. 75-118. [Zbl: 0555.68005] [Google Scholar]
  111. 6. K. CULIK II, Homomorphisms: Decidability, Equality and Tests Sets, in Formal Language Theory, Perspectives and Open Problem edited by R. Book, Academic Press, 1980, pp. 167-194. [Google Scholar]
  112. 7. C. CHOFFRUT and K. CULIK II, Folding of the Plane and the Design of Systolic Arrays, in Dynamical Systems and Cellular Automata, edited by J. Demongeot, E. Goles and M. Tchuente, Academic Press, 1984, pp. 313-320. [Zbl: 0531.68009] [MR: 818532] [Google Scholar]
  113. 8. K. CULIK II and J. KARHUMÄKI, A New Proof for The DOL Sequence Equivalence Problem and Its Implications, in Book of L, edited by G. Rozenberg and A. Salomaa, Springer-Verlag, 1985, pp. 63-74. [Zbl: 0586.68066] [Google Scholar]
  114. 9. K. CULIK II and J. KARHUMÄKI, The Decidability of the DT0L Sequence Problem and Related Decision Problems, in The Very Knowledge of Coding, edited by H. Laakso and A. Salomaa, University Press, 1987, pp. 43-54. [MR: 902641] [Zbl: 0641.68117] [Google Scholar]
  115. 10. K. CULIK II and J. KARHUMÄKI, Systems of Equations over a Finitely Generated Free Monoid Having an Effectively Findable Equivalent Finite Subsystem, in Semigroups Theory and Applications, edited by H. Jürgensen, G. Lallement and H. J. Weinert, Lecture Notes in Mathematics, Springer, 1988, 1320, pp. 18-27. [MR: 957757] [Zbl: 0648.68084] [Google Scholar]
  116. 11. K. CULIK II and J. KARHUMÄKI, A Note of HTOL Languages and the Equivalence of Deterministic Pushdown Transducers, in A Perspective in Theoretical Computer Science - A commemorative volume to Gift Siromoney, edited by R. Narasimhan, World Scientific Publishing Company PPTE Ltd., Singapore, Series in Computer Science, Vol. 16, 1989, pp. 23-32. [Google Scholar]
  117. 12. K. CULIK II, L. P. HURD and S. YU, Formal Languages and Global Cellular Automata Behavior, in Cellular Autonoma: Theory and Experiment, edited by H. Gutowitz, reprinted from Physica D, MIT Press - North Holland, 1991, pp. 396-403. [MR: 1094884] [Zbl: 0729.68053] [Google Scholar]
  118. 13. K. CULIK II, L. P. HURD and S. YU, Computation Theoretic Aspect of Cellular Automata, in Cellular Autonoma: Theory and Experiment, edited by H. Gutowitz, reprinted from Physica D, MIT Press - North Holland, 1991, pp. 357-378. [MR: 1094881] [Zbl: 0729.68052] [Google Scholar]
  119. 14. K. CULIK II, J. KARHUMÄKI and A. LEPISTÖ, Alternating Iteration of Morphisms and the Kolakovski sequence, In: Lindenmayer Systems, edited by G. Rozenberg and A. Salomaa, Springer-Verlag, 1992, pp. 93-103. [MR: 1226686] [Zbl: 0766.68073] [Google Scholar]
  120. 15. K. CULIK II and S. YU, Topological Transformations of Systolic Systems, in: Transformational Approaches to Systolic Designs, edited by G. M. Megson, Springer-Verlag (to appear). [Google Scholar]
  121. 16. K. CULIK II and J. KARI, Mechanisms for Pattern Generation, Proceedings of the Conference on Pattern Formation, Ontario, Cal., MIT Press (to appear). [Zbl: 0938.68724] [Google Scholar]
  122. 17. K. CULIK II and J. KARI, Efficient Inference Algorithm for Weighted Finite Automata, in Fractal Image Encoding and Compression, ed. Y. Fisher, Springer-Verlag (to appear). [Zbl: 0938.68724] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.