Publications of K. Culik
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 28 (1994) no. 3-4, pp. 425-430.
@misc{ITA_1994__28_3-4_425_0,
     title = {Publications of {K.} {Culik}},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {425--430},
     publisher = {EDP-Sciences},
     volume = {28},
     number = {3-4},
     year = {1994},
     mrnumber = {1282456},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1994__28_3-4_425_0/}
}
TY  - JOUR
TI  - Publications of K. Culik
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1994
DA  - 1994///
SP  - 425
EP  - 430
VL  - 28
IS  - 3-4
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1994__28_3-4_425_0/
UR  - https://www.ams.org/mathscinet-getitem?mr=1282456
LA  - en
ID  - ITA_1994__28_3-4_425_0
ER  - 
%0 Journal Article
%T Publications of K. Culik
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1994
%P 425-430
%V 28
%N 3-4
%I EDP-Sciences
%G en
%F ITA_1994__28_3-4_425_0
Publications of K. Culik. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 28 (1994) no. 3-4, pp. 425-430. http://www.numdam.org/item/ITA_1994__28_3-4_425_0/

1. K. Culik Ii, Decomposition of Automata and Note on Their Analysis (in Czech), Aplikace Matematiky, 1963, 8, pp. 292-301. | EuDML | MR | Zbl

2. K. Culik Ii, Construction of the Automaton Mapping (in Russian), Aplikace Matematiky, 1965, 10, pp. 459-468. | EuDML | MR | Zbl

3. K. Culik Ii, Relation Represented by n-tape Automata (in Czech), Kybernetika, 1967, 3, pp. 321-345. | Zbl

4. K. Culik Ii, Sequential Machines with Several Input and Output Tapes, Kybernetika, 1967, 3, pp. 540-559. | EuDML | Zbl

5. J. Culik, K. Culik Ii and J. Vogel, SIS - Programming Language for Simulation, Information Processing Machines, 1968, 14, pp. 119-152.

6. K. Culik Ii, Languages Represented by n-tape Automata, Information Processing Machines, 1968, 14, pp. 83-100. | MR

7. K. Culik Ii, A Contribution to Top-down Analysis of Context-Free Languages, Kybernetika, 1968, 4, pp. 422-431. | EuDML | MR | Zbl

8. K. Culik Ii, N-ary Grammars and the Description of Mapping of Languages, Kybernetika, 1970, 6, pp. 99-117. | EuDML | MR | Zbl

9. J. A. Brzozowski, K. Culik Ii and A. Gabrielian, Classification of Non-Counting Events, JCSS, 1971, 5, pp. 41-53. | MR | Zbl

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 | Zbl

11. K. Culik Ii, Abstract Families of Relations, JCSS, 1971, 5, pp. 596-605. | MR | Zbl

12. K. Culik Ii and R. Cohen, LR-regular Grammars - An Extension of LR (k) Grammars, JCSS, 1973, 7, pp. 66-96. | MR | Zbl

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

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 | Zbl

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

16. K. Culik Ii and J. Opatrny, Macro OL-Systems, International J. of Comp. Math. (Section A), 1975, 4, pp. 327-342. | Zbl

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

18. K. Culik Ii, On the Decidability of the Sequence Equivalence Problem for DOL-systems, Theoretical Computer Science, 1977, 3, pp. 75-84. | Zbl

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

20. K. Culik Ii and H. A. Maurer, Tree Controlled Grammars, Computing, 1977, 19, pp. 129-139. | MR | Zbl

21. K. Culik Ii and H. A. Maurer, Linearizing Selector-graphs and Applications Thereof, Angewandte Informatik, 1977, 9, pp. 386-394. | Zbl

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 | Zbl

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 | Zbl

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 | Zbl

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 | Zbl

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 | Zbl

27. K. Culik Ii, The Ultimate Equivalence Problem for DOL Systems, Acta Informatica, 1978, 10, pp. 69-84. | MR | Zbl

28. K. Culik Ii and D. Wood, Speed-Varying OL-Systems, Information Sciences, 1978, 14, pp. 161-170. | MR | Zbl

29. K. Culik Ii and A. Salomaa, On the Decidability of Homomorphism equivalence for Languages, JCCS, 1978, 17, pp. 163-175. | MR | Zbl

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 | Zbl

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

32. K. Culik Ii, A Purely Homomorphic Characterization of Recursively Enumerable Sets, JACM, 1979, 26, pp. 345-350. | MR | Zbl

33. K. Culik Ii, Some Decidability Results about Regular and Push Down Translations, Information Processing Letters, 1979, 8, pp. 5-8. | MR | Zbl

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 | Zbl

35. K. Culik Ii and D. Wood, A Mathematical Investigation of Parallel Graph OL Systems, Inf. and Control, 1979, 43, pp. 50-82. | MR | Zbl

36. K. Culik Ii and H. A. Maurer, On Simple Representations of Language Families, RAIRO Informatique théorique, 1979, 13, pp. 241-250. | Numdam | MR | Zbl

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 | Zbl

38. K. Culik Ii and J. Karhumaki, Interactive L-systems with Almost Interactionless Behavior, Inf. and Control, 1979, 43, pp. 83-100. | MR | Zbl

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 | Zbl

40. K. Culik Ii and A. Salomaa, Test Sets and Checking Words for Homomorphism Equivalence, JCSS, 1980, 20, pp. 379-395. | MR | Zbl

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. | Numdam | MR | Zbl

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 | Zbl

43. K. Culik Ii, Th. Ottmann and D. Wood, Dense Multiway Trees, ACM Transactions on Database Systems, 1981, 6, pp. 486-512. | MR | Zbl

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 | Zbl

45. K. Culik Ii and J. Pachl, Equivalence Problems for Mappings on Infinite Strings, Inf. and Control, 1981, 49, pp. 52-63. | MR | Zbl

46. K. Culik Ii and D. Wood, Note on Recurrent Words, Inf. and Control, 1981, 51, pp. 88-94. | MR | Zbl

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 | Zbl

48. K. Culik Ii and A. Salomaa, On Infinite Words Obtained by iterating Morphisms, Theoretical Computer Science, 1982, 19, pp. 29-38. | MR | Zbl

49. K. Culik Ii and T. Harju, Dominoes Over a Free Monoid, Theoretical Computer Science, 1982, 18, pp. 279-300. | MR | Zbl

50. J. Albert and K. Culik, Tree Correspondance Problems, JCSS, 1982, 24, pp. 167-179. | MR | Zbl

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 | Zbl

52. K. Culik Ii and D. Wood, A Note on Some Tree Similarity Measures, Information Processing Letters, 1982, 15, pp. 39-42. | MR | Zbl

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 | Zbl

54. C. Choffrut and K. Culik Ii, Properties of Finite and Pushdown Transducers, SIAM J. on Comp., 1983, 12, pp. 300-315. | MR | Zbl

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 | Zbl

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 | Zbl

57. K. Culik Ii, J. Gruska and A. Salomaa, Systolic Automata for VLSI on Balanced Trees, Acta Informatica, 1983, 18, pp. 335-344. | MR | Zbl

58. K. Culik Ii and J. Karhumaki, On the Ehrenfeucht Conjecture for DOL Languages, RAIRO, Informatique théorique, 1983, 17, pp. 205-230. | Numdam | MR | Zbl

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 | Zbl

60. K. Culik Ii and A. Salomaa, Ambiguity and Decision Problems Concerning Number Systems, Inf. and Control, 1983, 56, pp. 139-153. | MR | Zbl

61. K. Culik Ii and H. Jurgensen, Programmable Finite Automata for VLSI, Int. J. Comp. Math. (Section A), 1983, 14, pp. 259-275. | MR | Zbl

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 | Zbl

63. K. Culik Ii and T. Harju, The Omega-Sequence Equivalence Problem for DOL System is Decidable, JACM, 1984, 31, pp. 282-298. | MR | Zbl

64. K. Culik Ii, A. Salomaa and D. Wood, Systolic Tree Acceptors, RAIRO, Informatique théorique, 1984, 18, pp. 53-69. | Numdam | MR | Zbl

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 | Zbl

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 | Zbl

67. W. Bucher, K. Culik Ii, On Real Time and Linear Time Cellular Automata, RAIRO, Informatique théorique, 1984, 18, pp. 307-325. | Numdam | MR | Zbl

68. C. Choffrut and K. Culik Ii, On Extendibility of Unavoidable Sets, Discrete Mathematics, 1984, 9, pp. 125-137. | MR | Zbl

69. K. Culik Ii and Sheng Yu, Iterative Tree Automata, Theoretical Computer Science, 1984, 32, pp. 227-247. | MR | Zbl

70. C. Choffrut and K. Culik Ii, On Real-Time Cellular Automata and Trellis Automata, Acta Informatica, 1984, 21, pp. 393-407. | MR | Zbl

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 | Zbl

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 | Zbl

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 | Zbl

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 | Zbl

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

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 | Zbl

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 | Zbl

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 | Zbl

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

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 | Zbl

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

82. K. Culik Ii and J. Karhumäki, On Totalistic Systolic Networks, Inform. Processing Letters, 1987/88, 26, pp. 213-236. | MR | Zbl

83. K. Culik Ii, On Invertible Cellular Automata, Complex Systems, 1987, 1, pp. 1035-1044. | MR | Zbl

84. K. Culik Ii and S. Yu, Undecidability of CA Classification Schemes, Complex Systems, 1988, 2, pp. 177-190. | MR | Zbl

85. K. Culik Ii, Variations of the Firing Squad Problem and Applications, Information Processing Letters, 1989, 30, pp. 153-157. | MR | Zbl

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 | Zbl

87. K. Culik Ii and J. Karhumäki, HDTOL Matching of Computations of multitape automata, Acta Informatica, 1989, 27, pp. 179-191. | MR | Zbl

88. K. Culik Ii and S. Dube, Fractal and Recurrent Behavior of Cellular Automata, Complex Systems, 1989, 3, pp. 253-267. | MR | Zbl

89. K. Culik Ii, New Techniques for Proving the Decidability of Equivalence Problems, Theoretical Computer Science, 1990, 71, pp. 29-45. | MR | Zbl

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 | Zbl

91. K. Culik Ii, L. P. Hurd and S. Yu, Computation Theoretic Aspect of Cellular Automata, Physica D, 1990, 45, pp. 357-378. | MR | Zbl

92. K. Culik Ii and J. Karhumäki, Loops in Automata and HDTOL Relations, RAIRO Informatique théorique, 1990, 24, pp. 327-336. | Numdam | MR | Zbl

93. K. Culik Ii and T. Harju, Dominoes, Splicing Semigroups and DNA, Discrete Applied Mathematics, 1991, 31, pp. 261-277. | MR | Zbl

94. K. Culik Ii and S. Yu, Cellular Automate, ωω-Regular Sets, and Sofic Systems, Discrete Applied Mathematics, 1991, 32, pp. 85-102. | MR | Zbl

95. K. Culik Ii and S. Dube, An Efficient Solution to the Firing Mob Problem, Theor. Comp. Science, 1991, 91, pp. 57-69. | MR | Zbl

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 | Zbl

97. K. Culik Ii and S. Dube, Rational and Affine Expressions for Image Description, Discrete Applied Mathematics, 1993, 41, pp. 85-120. | MR | Zbl

98. K. Culik and J. Kari, Image Compression Using Weighted Finite Automata. Computer and Graphics, vol. 17, 1993, 3, pp. 305-313. | MR

99. K. Culik Ii and S. Dube, L-systems and Mutually Recursive Function Systems, Acta Informatica, 1993, 30, pp. 279-302. | MR | Zbl

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 | Zbl

101. K. Culik Ii and S. Dube, Balancing Order and Chaos in Image Generation, Computer and Graphics (to appear).

102. K. Culik Ii and S. Dube, Encoding Images as Words and Languages. Int. J. of Algebra and Commutation (to appear). | MR | Zbl

103. K. Culik Ii and J. Karhumäki, Iterative Devices Generating Infinite words. Int. J. on Foundation of Computer Science (to appear). | Zbl

104. K. Culik Ii and J. Karhumäki, Finite Automata Computing Real Functions. SIAM J. on Computing (to appear). | MR | Zbl

105. K. Culik Ii and I. Fris, Weighted Finite Transducers in Image Processing. Discrete Applied Mathematics (to appear). Contributions to Books: | MR | Zbl

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 | Zbl

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 | Zbl

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

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

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

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.

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. | MR

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

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 | Zbl

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 | Zbl

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.

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 | Zbl

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 | Zbl

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 | Zbl

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).

16. K. Culik Ii and J. Kari, Mechanisms for Pattern Generation, Proceedings of the Conference on Pattern Formation, Ontario, Cal., MIT Press (to appear).

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).