Voir la notice de l'article provenant de la source Numdam
@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://geodesic.mathdoc.fr/item/ITA_1994__28_3-4_425_0/}
}
Publications of K. Culik. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Special issue for Professor Karel Culik II : 60 th birthday, Tome 28 (1994) no. 3-4, pp. 425-430. http://geodesic.mathdoc.fr/item/ITA_1994__28_3-4_425_0/
1. , Decomposition of Automata and Note on Their Analysis (in Czech), Aplikace Matematiky, 1963, 8, pp. 292-301. | Zbl | MR | EuDML
2. , Construction of the Automaton Mapping (in Russian), Aplikace Matematiky, 1965, 10, pp. 459-468. | Zbl | MR | EuDML
3. , Relation Represented by n-tape Automata (in Czech), Kybernetika, 1967, 3, pp. 321-345. | Zbl
4. , Sequential Machines with Several Input and Output Tapes, Kybernetika, 1967, 3, pp. 540-559. | Zbl | EuDML
5. , and , SIS - Programming Language for Simulation, Information Processing Machines, 1968, 14, pp. 119-152.
6. , Languages Represented by n-tape Automata, Information Processing Machines, 1968, 14, pp. 83-100. | MR
7. , A Contribution to Top-down Analysis of Context-Free Languages, Kybernetika, 1968, 4, pp. 422-431. | Zbl | MR | EuDML
8. , N-ary Grammars and the Description of Mapping of Languages, Kybernetika, 1970, 6, pp. 99-117. | Zbl | MR | EuDML
9. , and , Classification of Non-Counting Events, JCSS, 1971, 5, pp. 41-53. | Zbl | MR
10. and , Formal Schemes for Language Translations, International J. of Comp. Math. (Section A), 1971, 3, pp. 17-48. | Zbl | MR
11. , Abstract Families of Relations, JCSS, 1971, 5, pp. 596-605. | Zbl | MR
12. and , LR-regular Grammars - An Extension of LR (k) Grammars, JCSS, 1973, 7, pp. 66-96. | Zbl | MR
13. , A Model for the Formal Definition of Programming Languages, International J. of Computer Math. (Section A), 1973, 3, pp. 315-345. | Zbl
14. , On Some Families of Languages Related to Development Systems, International J. of Computer Math., (Section A), 1974, 4, pp. 31-42. | Zbl | MR
15. and , Literal Homomorphisms of OL-Languages, International J. of Comp. Math., (Section A), 1974, 4, pp. 247-267. | Zbl
16. and , Macro OL-Systems, International J. of Comp. Math. (Section A), 1975, 4, pp. 327-342. | Zbl
17. and , Parallel Rewriting on Graphs and Multidimensional Development, Int. Journal of General Systems, 1976, 3, pp. 53-66. | Zbl
18. , On the Decidability of the Sequence Equivalence Problem for DOL-systems, Theoretical Computer Science, 1977, 3, pp. 75-84. | Zbl
19. and , The Decidability of the Equivalence Problem for DOL-systems, Information and Control, 1977, 35, pp. 20-39. | Zbl
20. and , Tree Controlled Grammars, Computing, 1977, 19, pp. 129-139. | Zbl | MR
21. and , Linearizing Selector-graphs and Applications Thereof, Angewandte Informatik, 1977, 9, pp. 386-394. | Zbl
22. , The Decidability of v-Local Catenativity and of Other Properties of DOL Systems, Information Processing Letters, 1978, 7, pp. 33-35. | Zbl | MR
23. and , String Representation of Graphs, Int. J. of Comp. Math. (Section A), 1978, 6, pp. 273-301. | Zbl | MR
24. and , Propagating Chain-free Normal Forms for EOL Systems, Information and Control, 1978, 36, pp. 309-319. | Zbl | MR
25. , and , On Two-symbol Complete EOL Forms, Theoretical Computer Science, 1978, 6, pp. 69-92. | Zbl | MR
26. , , , and , Isomorphism, Form Equivalence and Sequence Equivalence of PDOL Forms, Theoretical Computer Science, 1978, 6, pp. 143-173. | Zbl | MR
27. , The Ultimate Equivalence Problem for DOL Systems, Acta Informatica, 1978, 10, pp. 69-84. | Zbl | MR
28. and , Speed-Varying OL-Systems, Information Sciences, 1978, 14, pp. 161-170. | Zbl | MR
29. and , On the Decidability of Homomorphism equivalence for Languages, JCCS, 1978, 17, pp. 163-175. | Zbl | MR
30. and , Double Deterministic Tabled OL Systems, Int. J. of Computer and Inf. Sciences, 1979, 8, pp. 335-347. | Zbl | MR
31. and , Growing Cellular Systems: Generation of Graphs by Parallel Rewriting, Int. J. General Systems, 1979, 5, pp. 45-55. | Zbl
32. , A Purely Homomorphic Characterization of Recursively Enumerable Sets, JACM, 1979, 26, pp. 345-350. | Zbl | MR
33. , Some Decidability Results about Regular and Push Down Translations, Information Processing Letters, 1979, 8, pp. 5-8. | Zbl | MR
34. and , Homomorphism Equivalence on ETOL Languages, Int. J. of Computer Math. (Section A), 1979, 7, pp. 43-51. | Zbl | MR
35. and , A Mathematical Investigation of Parallel Graph OL Systems, Inf. and Control, 1979, 43, pp. 50-82. | Zbl | MR
36. and , On Simple Representations of Language Families, RAIRO Informatique théorique, 1979, 13, pp. 241-250. | Zbl | MR | mathdoc-id
37. and , Secure Information Storage and Retrieval Using New Results in Cryptography, Inf. Processing Letters, 1979, 8, pp. 181-186. | Zbl | MR
38. and , Interactive L-systems with Almost Interactionless Behavior, Inf. and Control, 1979, 43, pp. 83-100. | Zbl | MR
39. and , A Homomorphic Characterization of Time and Space Complexity Classes of Languages, Int. J. of Computer Math. (Section A), 1980, 8, pp. 207-222. | Zbl | MR
40. and , Test Sets and Checking Words for Homomorphism Equivalence, JCSS, 1980, 20, pp. 379-395. | Zbl | MR
41. and , On the Equality Sets for Homomorphisms on Free Monoids with Two Generators, RAIRO Informatique théorique, 1980, 14, pp. 349-369. | Zbl | MR | mathdoc-id
42. and , Test Sets for Homomorphism Equivalence on Context Free Languages, Inf. and Control, 1980, 45, pp. 273-284. | Zbl | MR
43. , and , Dense Multiway Trees, ACM Transactions on Database Systems, 1981, 6, pp. 486-512. | Zbl | MR
44. , , and , Concise Description of Finite Languages, Theoretical Computer Science, 1981, 14, pp. 227-246. | Zbl | MR
45. and , Equivalence Problems for Mappings on Infinite Strings, Inf. and Control, 1981, 49, pp. 52-63. | Zbl | MR
46. and , Note on Recurrent Words, Inf. and Control, 1981, 51, pp. 88-94. | Zbl | MR
47. , and , A Homomorphic Characterization of Regular Languages, Applied Discrete Mathematics, 1982, 4, pp. 149-152. | Zbl | MR
48. and , On Infinite Words Obtained by iterating Morphisms, Theoretical Computer Science, 1982, 19, pp. 29-38. | Zbl | MR
49. and , Dominoes Over a Free Monoid, Theoretical Computer Science, 1982, 18, pp. 279-300. | Zbl | MR
50. and , Tree Correspondance Problems, JCSS, 1982, 24, pp. 167-179. | Zbl | MR
51. , and , Test Sets for Context-Free Languages and Systems of Equations over a Free Monoid, Inf. and Control, 1982, 52, pp. 172-186. | Zbl | MR
52. and , A Note on Some Tree Similarity Measures, Information Processing Letters, 1982, 15, pp. 39-42. | Zbl | MR
53. and , Transductions and the Parallel Generation of Language, Inter. J. Comp. Math (Section A), 1983, 13, pp. 3-15. | Zbl | MR
54. and , Properties of Finite and Pushdown Transducers, SIAM J. on Comp., 1983, 12, pp. 300-315. | Zbl | MR
55. and , Systems of Equations over a Free Monoid and Ehrenfeucht Conjecture, Discrete Mathematics, 1983, 43, pp. 139-153. | Zbl | MR
56. , and , On a Family of L-Ianguages Resulting from Systolic Tree Automata, Theoretical Computer Science, 1983, 23, pp. 231-242. | Zbl | MR
57. , and , Systolic Automata for VLSI on Balanced Trees, Acta Informatica, 1983, 18, pp. 335-344. | Zbl | MR
58. and , On the Ehrenfeucht Conjecture for DOL Languages, RAIRO, Informatique théorique, 1983, 17, pp. 205-230. | Zbl | MR | mathdoc-id
59. and , Folding of the Plane and the Design of Systolic Arrays, Inform. Processing Letters, 1983, 17, pp. 149-153. | Zbl | MR
60. and , Ambiguity and Decision Problems Concerning Number Systems, Inf. and Control, 1983, 56, pp. 139-153. | Zbl | MR
61. and , Programmable Finite Automata for VLSI, Int. J. Comp. Math. (Section A), 1983, 14, pp. 259-275. | Zbl | MR
62. , and , Context-free Complexity of Finite Language, Theoretical Computer Science, 1984, 28, pp. 277-286. | Zbl | MR
63. and , The Omega-Sequence Equivalence Problem for DOL System is Decidable, JACM, 1984, 31, pp. 282-298. | Zbl | MR
64. , and , Systolic Tree Acceptors, RAIRO, Informatique théorique, 1984, 18, pp. 53-69. | Zbl | MR | mathdoc-id
65. , and , Systolic Trellis Automata, Part I, Inter. J. of Computer Math. (Section A), 1984, 15, pp. 195-212. | Zbl | MR
66. , and , Systolic Trellis Automata, Part II, Inter. J. of Computer Math. (Section A), 1984, 16, pp. 3-22. | Zbl | MR
67. , , On Real Time and Linear Time Cellular Automata, RAIRO, Informatique théorique, 1984, 18, pp. 307-325. | Zbl | MR | mathdoc-id
68. and , On Extendibility of Unavoidable Sets, Discrete Mathematics, 1984, 9, pp. 125-137. | Zbl | MR
69. and , Iterative Tree Automata, Theoretical Computer Science, 1984, 32, pp. 227-247. | Zbl | MR
70. and , On Real-Time Cellular Automata and Trellis Automata, Acta Informatica, 1984, 21, pp. 393-407. | Zbl | MR
71. and , Topological Transformations as a Tool in The Design of Systolic Networks, Theoretical Computer Science, 1985, 37, pp. 183-216. | Zbl | MR
72. and , Synchronizable Deterministic Pushdown Automata and the Decidability of Their Equivalence, Acta Informatica, 1986, 23, pp. 597-605. | Zbl | MR
73. , and , Systolic Trellis Automata: Stability, Decidability and Complexity, Information and Control, 1986, 71, pp. 218-230. | Zbl | MR
74. and , A Note on the Equivalence Problem of Rotational Formal Power Series, Inform. Processing Letters, 1986, 23, pp. 29-31. | Zbl | MR
75. , and , Iterative Tree Arrays with Logarithmic Depth, Intern. J. of Computer Math. (Section A), 1986, 20, pp. 187-204. | Zbl
76. and , Real Time, Pseudo Real Time and Linear Time ITA, Theoretical Computer Science, 1986, 47, pp. 15-26. | Zbl | MR
77. and , The Equivalence Problem of Finite-valued Finite Transducers (on HDTOL Languages) is Decidable, Theoretical Computer Science, 1986, 47, pp. 71-84. | Zbl | MR
78. and , The Equivalence Problem for Single-Valued Two-Way Transducers is Decidable, SIAM J. on Comput., 1987, 16, pp. 221-230. | Zbl | MR
79. and , Fault-Tolerant Schemes for Some Systolic Systems, Intern. J. on Comp. Math. (Section A), 1987, 22, pp. 13-42. | Zbl
80. and , A Simple Universal Cellular Automaton and its One-Way and Totalistic Version, J. Complex Systems, 1987, 1, pp. 1-16. | Zbl | MR
81. , and , Systolic Tree Architecture for Some Standard Functions, Computers and Artificial Intelligence, 1987, 6, pp. 243-261. | Zbl
82. and , On Totalistic Systolic Networks, Inform. Processing Letters, 1987/88, 26, pp. 213-236. | Zbl | MR
83. , On Invertible Cellular Automata, Complex Systems, 1987, 1, pp. 1035-1044. | Zbl | MR
84. and , Undecidability of CA Classification Schemes, Complex Systems, 1988, 2, pp. 177-190. | Zbl | MR
85. , Variations of the Firing Squad Problem and Applications, Information Processing Letters, 1989, 30, pp. 153-157. | Zbl | MR
86. , and , On the Limit Sets of Cellular Automata, SIAM J. on Computing, 1989, 18, pp. 831-842. | Zbl | MR
87. and , HDTOL Matching of Computations of multitape automata, Acta Informatica, 1989, 27, pp. 179-191. | Zbl | MR
88. and , Fractal and Recurrent Behavior of Cellular Automata, Complex Systems, 1989, 3, pp. 253-267. | Zbl | MR
89. , New Techniques for Proving the Decidability of Equivalence Problems, Theoretical Computer Science, 1990, 71, pp. 29-45. | Zbl | MR
90. , and , Formal Languages and Global Cellular Automata Behavior, Physica D, 1990, 45, pp. 396-403. | Zbl | MR
91. , and , Computation Theoretic Aspect of Cellular Automata, Physica D, 1990, 45, pp. 357-378. | Zbl | MR
92. and , Loops in Automata and HDTOL Relations, RAIRO Informatique théorique, 1990, 24, pp. 327-336. | Zbl | MR | mathdoc-id
93. and , Dominoes, Splicing Semigroups and DNA, Discrete Applied Mathematics, 1991, 31, pp. 261-277. | Zbl | MR
94. and , Cellular Automate, ωω-Regular Sets, and Sofic Systems, Discrete Applied Mathematics, 1991, 32, pp. 85-102. | Zbl | MR
95. and , An Efficient Solution to the Firing Mob Problem, Theor. Comp. Science, 1991, 91, pp. 57-69. | Zbl | MR
96. , and , The Topological Entropy of Cellular Automata is Uncomputable. Ergodic Theory and Dynamical Systems, 1992, 12, pp. 255-265. | Zbl | MR
97. and , Rational and Affine Expressions for Image Description, Discrete Applied Mathematics, 1993, 41, pp. 85-120. | Zbl | MR
98. and , Image Compression Using Weighted Finite Automata. Computer and Graphics, vol. 17, 1993, 3, pp. 305-313. | MR
99. and , L-systems and Mutually Recursive Function Systems, Acta Informatica, 1993, 30, pp. 279-302. | Zbl | MR
100. and , Affine Automata and Related Techniques for Generation of Complex Images. Theoretical Computer Science, 1993, 116, pp. 373-398. | Zbl | MR
101. and , Balancing Order and Chaos in Image Generation, Computer and Graphics (to appear).
102. and , Encoding Images as Words and Languages. Int. J. of Algebra and Commutation (to appear). | Zbl | MR
103. and , Iterative Devices Generating Infinite words. Int. J. on Foundation of Computer Science (to appear). | Zbl
104. and , Finite Automata Computing Real Functions. SIAM J. on Computing (to appear). | Zbl | MR
105. and , Weighted Finite Transducers in Image Processing. Discrete Applied Mathematics (to appear). Contributions to Books: | Zbl | MR
1. and , 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. | Zbl | MR
2. , Structural OL Systems, in L-systems, edited by G. Rozenberg, A. Salomaa, Lectures Notes in Computer Science, 1974, 15, pp. 216-219. | Zbl | MR
3. and , 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. and , 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. and , 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. , 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. and , 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. and , 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. and , 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. | Zbl | MR
10. and , 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. | Zbl | MR
11. and , 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. , and , 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. | Zbl | MR
13. , and , 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. | Zbl | MR
14. , and , Alternating Iteration of Morphisms and the Kolakovski sequence, In: Lindenmayer Systems, edited by G. Rozenberg and A. Salomaa, Springer-Verlag, 1992, pp. 93-103. | Zbl | MR
15. and , Topological Transformations of Systolic Systems, in: Transformational Approaches to Systolic Designs, edited by G. M. Megson, Springer-Verlag (to appear).
16. and , Mechanisms for Pattern Generation, Proceedings of the Conference on Pattern Formation, Ontario, Cal., MIT Press (to appear).
17. and , Efficient Inference Algorithm for Weighted Finite Automata, in Fractal Image Encoding and Compression, ed. Y. Fisher, Springer-Verlag (to appear).