Advertisement

Boris A. Trakhtenbrot: Academic Genealogy and Publications

  • Arnon Avron
  • Nachum Dershowitz
  • Alexander Rabinovich
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4800)

Abstract

According to the Mathematics Genealogy Project (at http://genealogy. math.ndsu.nodak.edu ), Trakhtenbrot’s ancestral dag is rooted in Otto Mencke (who received his degree in 1666, but whose advisor is not listed).

Keywords

Turing Machine Finite Automaton USSR Academy Recursive Operator Automaton Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    The impossibility of an algorithm for the decidability problem on finite classes. Doklady AN SSR 70(4), 569–572 (1950)Google Scholar
  2. 2.
    Decidability problems for finite classes and definitions of finite sets, Ph.D. Thesis, Math. Inst. of the Ukrainian Academy of Sciences, Kiev (1950)Google Scholar
  3. 3.
    On recursive separability. Doklady AN SSR 88(6), 953–956 (1953)Google Scholar
  4. 4.
    Tabular representation of recursive operators. Doklady AN SSR 101(4), 417–420 (1955)Google Scholar
  5. 5.
    Modelling functions on finite set. Uchionnye Zapiski Pennenskogo Pedinstituta (Transactions of the Pensa Pedagogical Institute), (2), 61–78 (1955)Google Scholar
  6. 6.
    The synthesis of non-repetitive schemas. Doklady AN SSR 103(6), 973–976 (1955)Google Scholar
  7. 7.
    Kuznetsov, A.V., Trakhtenbrot, B.A.: Investigation of partial recursive operators by techniques of Baire spaces. Doklady AN SSR 105(6), 896–900 (1955)Google Scholar
  8. 8.
    On the definition of finite set and the deductive incompleteness of set theory. Izvestia AN SSR 20, 569–582 (1956)Google Scholar
  9. 9.
    Signalizing functions and tabular operators. Uchionnye Zapiski Penzenskogo Pedinstituta (Transactions of the Penza Pedagogoical Institute) (4), 75–87 (1956)Google Scholar
  10. 10.
    On effective operators and their properties connected to continuity. In: Proceedings of the Third All-Union Mathematical Congress, Moscow, vol. 2, pp. 147–148 (1956)Google Scholar
  11. 11.
    Algorithms and automatic solution of problems. Mathematics in the School, (4–5) (1956)Google Scholar
  12. 12.
    Descriptive classifications in recursive arithmetic. In: Proceedings of the Third All-Union Mathematical Congress, Moscow, vol. 1, p. 185 (1956)Google Scholar
  13. 13.
    Applying some topological invariants to the synthesis of two-polar switching schemes. In: Proceedings of the Third All-Union Mathematical Congress, Moscow, vol. 1, p. 136 (1956)Google Scholar
  14. 14.
    On operators, realizable by logical nets. Doklady AN SSR 112(6), 1005–1006 (1957)Google Scholar
  15. 15.
    The synthesis of logical nets whose operators are described in terms of monadic predicates. Doklady AN SSR 118(4), 646–649 (1958)Google Scholar
  16. 16.
    On the theory of non-repetitive schemes. Trudy Mathem. Instituta im. Steklova (Transactions of the Steklov Mathem. Institute) 51, 226–269 (1958)Google Scholar
  17. 17.
    The asymptotic estimate of the logical nets with memory. Doklady AN SSR 127(2), 281–284 (1959)Google Scholar
  18. 18.
    Kobrinski, N.E., Trakhtenbrot, B.A.: Fundamentals of the theory of logical nets. In: Computing Techniques and Their Application, Moscow, pp. 248–268 (1959)Google Scholar
  19. 19.
    Sketching of a general theory of logical nets. In: Logical Investigations, The Institute of Philosophy of the Academy of Sciences, Moscow, pp. 352–378 (1959)Google Scholar
  20. 20.
    Some constructions in the monadic predicate calculus. Doklady AN SSR 138(2), 320–321 (1961)Google Scholar
  21. 21.
    Finite automata and the monadic predicate calculus. Doklady AN SSR 140(2), 326–329 (1961)Google Scholar
  22. 22.
    Finite automata and the monadic predicate calculus. Siberian Mathematical Journal 3(1), 103–131 (1962)Google Scholar
  23. 23.
    Investigations on the synthesis of finite automata, Doctoral Thesis, Math. Inst. of the Siberian Branch of the USSR Academy of Sciences, Novosibirsk (1962)Google Scholar
  24. 24.
    On the frequency computation of recursive functions. Algebra i Logika 1(1), 25–32 (1963)Google Scholar
  25. 25.
    Finite automata. In: Proceedings of the Fourth All-Union Math. Congress, 1961, Nauka, Moscow, vol. 2, pp. 93–101 (1964)Google Scholar
  26. 26.
    On an estimate for the weight of a finite tree. Siberian Mathematical Journal 5(1), 186–191 (1964)Google Scholar
  27. 27.
    On the complexity of schemas that realize many-parametric families of operators. Problemy Kibernetiki 12, 99–112 (1964)Google Scholar
  28. 28.
    Turing computations with logarithmic delay. Algebra i Logika 3(4), 33–48 (1964)Google Scholar
  29. 29.
    Automata theory. Automation of Electronic Industries Encyclopedia 1 (1964)Google Scholar
  30. 30.
    Optimal computations and the frequency phenomena of Yablonski. Algebra i Logika 4(5), 79–93 (1965)Google Scholar
  31. 31.
    On normalized signalizing functions for Turing computation. Algebra i Logika 5(6), 61–70 (1966)Google Scholar
  32. 32.
    On complexity of computations. In: Abstracts of the International Mathematical Congress, Section 1, Moscow, p. 26 (1966)Google Scholar
  33. 33.
    Barzdin, Y.M., Trakhtenbrot, B.A.: On the current situation in the behavioral theory ofautomata. In: Abstracts of the Conference on Automata Theory and Artificial Intelligence, Tashkent, Computing Center of the USSR Academy of Sciences, pp. 10–11 (1968)Google Scholar
  34. 34.
    Trakhtenbrot, B.A., Valiev, M.: On the complexity of the mutual reduction of the identity-problem for finite definable groups and the decidability of enumerable sets. In: Abstracts of the IX All-Union Symposium on Algebra, Gomel, pp. 41–42 (1968)Google Scholar
  35. 35.
    On the complexity of the mutual-reduction algorithms in the construction of Novikov and Boone. Algebra i Logika 8, 50–71 (1969)Google Scholar
  36. 36.
    The theory of algorithms in the USSR. In: History of Mathematics in our Country, Kiev, pp. 409–431 (1970)Google Scholar
  37. 37.
    On autoreducibility. Doklady AN SSR 192(6), 1224–1227 (1970)Google Scholar
  38. 38.
    Some applications of the theory of complexity of computations. Inform. Bulletin of the Cybernetics Scientific Council, Academy of Sciences (5), 61–74 (1970)Google Scholar
  39. 39.
    Complexity of computations on discrete automata. Studien zur Algebra und ihre Anwendungen, p. 152. Akademie Verlag, Berlin (1972)Google Scholar
  40. 40.
    On autoreducible and non-autoreducible predicates and sets. Investigations in the Theory of Algorithms and Mathematical Logic, Computer Center, Academy of Sci. 1, 211–235 (1973)Google Scholar
  41. 41.
    Frequency computations, Trudy Matem. Instituta im. Steklova Transactions of the Steklov Mathematical Institute 133, 221–232 (1973)Google Scholar
  42. 42.
    Formalization of some notions in terms of computation complexity. In: Proceedings of the 1st International Congress for Logic,Methodology and Philosophy of Science, Studies in Logic and Foundations of Mathematics, vol. 74, pp. 205–214 (1973)Google Scholar
  43. 43.
    On universal classes of program-schemes, International Symposium on Theoretical Programming, Novosibirsk, Lecture Notes in Computer Science, vol. 5, Springer-Verlag, Berlin, pp. 144–151 (1974)Google Scholar
  44. 44.
    Notes on the complexity of probabilistic machine computations. In: The Computing Center of the Academy of Sciences (ed.) Theory of Algorithms and Mathematical Logic. pp. 159–176 (1974)Google Scholar
  45. 45.
    Alexey Andreevich Lyapunov (in Russian), Mathematics in the School (3) (1974) (a) German translation in: Mathematik in der Schule, Jg 13, no. 4, pp. 203–209, Berlin (1975) (b) Alexey Andreevich Lyapunov. In: Essays on the History of Informatics in Russia, Nauchno-Izdatel’skiy Tsentr Sibirskogo Otdeleniya Rossiyskoy Akademii Nauk, Novosibirsk, pp. 470–480 (1998)Google Scholar
  46. 46.
    Abstraktnaya teoriya avtomatov (Abstract automata theory; in Russian). Encyclopedia Kibernetika 1, 11–12 Kiev (1974)Google Scholar
  47. 47.
    Avtomatov teorija (Theory of automata; in Russian), Encyclopedia of Cybernetics, vol. 1, pp. 57–60, Kiev (1974)Google Scholar
  48. 48.
    Mery slozhnosti v teorii avtomatov (Complexity measures in automata theory; in Russian). Encyclopedia of Cybernetics 1, 588–590 (1974)Google Scholar
  49. 49.
    Povedenie avtomatov (Behavior of automata; in Russian). Encyclopedia of Cybernetics 2, 166–169 (1974)Google Scholar
  50. 50.
    Yazyk logicheskiy dlya zadaniya avtomatov (Logical language for specifications of automata; in Russian). Encyclopedia of Cybernetics, Kiev, vol. 1, pp. 595–596 (1974)Google Scholar
  51. 51.
    On problems solvable by successive trials. In: Becvar, J. (ed.) MFCS 1975. LNCS, vol. 32, pp. 125–138. Springer, Heidelberg (1975)Google Scholar
  52. 52.
    Recursive program schemas and computable functionals. In: Mazurkiewicz, A. (ed.) MFCS 1976. LNCS, vol. 45, pp. 137–151. Springer, Heidelberg (1976)Google Scholar
  53. 53.
    Frequency algorithms and computations. In: Gruska, J. (ed.) MFCS 1977. LNCS, vol. 53, pp. 148–161. Springer, Heidelberg (1977)Google Scholar
  54. 54.
    On the semantics of algorithmic languages. In: Proceedings of the Symposium on Development Perspectives in System and Theoretical Programming, Novosibirsk, pp. 77–84 (1978)Google Scholar
  55. 55.
    Semantics and logic of algorithm languages. Semiotika i Informatika, Moscow 13, 47–85 (1979)Google Scholar
  56. 56.
    On the completeness of algorithmic logic. Kibernetika, Kiev (2), 6–11 (1979)Google Scholar
  57. 57.
    Relaxation rules of algorithmic logic. In: Schlender, B., Frielinghaus, W. (eds.) GI-Fachtagung 1974. LNCS, vol. 7, pp. 453–462. Springer, Heidelberg (1974)Google Scholar
  58. 58.
    Vospitanie matematiko-logicheskoy kultury uchashchikhs’a (On mathematical-logical education; in Russian), In: Olimpiada, Algebra, Kombinatorika, Nauka, Novosibirsk, pp. 26–52 (1979)Google Scholar
  59. 59.
    Some reflections on the connection between computer science and the theory of algorithms. In: Knuth, D.E., Ershov, A.P. (eds.) Algorithms in Modern Mathematics and Computer Science. LNCS, vol. 122, pp. 461–462. Springer, Heidelberg (1981)Google Scholar
  60. 60.
    On denotational semantics and axiomatization of partial correctness for languages with procedures as parameters and with aliasing (Extended abstract), Technical Report, Tel Aviv University, 20 pages (August 1981)Google Scholar
  61. 61.
    Trakhtenbrot, B.A., Halpern, J., Meyer, A.: From denotational to operational and axiomatic semantics for Algol-like languages (An overview). In: Clarke, E., Kozen, D. (eds.) Logic of Programs 1983. LNCS, vol. 164, pp. 474–500. Springer, Heidelberg (1984)Google Scholar
  62. 62.
    Halpern, J., Meyer, A., Trakhtenbrot, B.A.: The semantics of local storage, or what makes the free list free (preliminary report). In: Conference Record of the XI ACM Symposium on Principles of Programming Languages (POPL), pp. 245–257 (1984)Google Scholar
  63. 63.
    A survey on Russian approaches to perebor (brute force search algorithms). Annals of the History of Computing 6(4), 384–400 (1984)Google Scholar
  64. 64.
    On logical relations in program semantics. In: Proceedings of the Conference on Mathematical Logic and its Applications, Dedicated to the 80th Anniversary of Kurt Gödel, Druzhba, Bulgaria, pp. 213–229. Plenum Press, New York (1987)Google Scholar
  65. 65.
    Comparing the Church and Turing approaches: Two prophetical messages. In: The Universal Turing Machine – A Half-Century Survey, pp. 603–630. Oxford University Press, Oxford (1988) (a) 2nd edn. Springer-Verlag, Wien, pp. 557–582 (1995)Google Scholar
  66. 66.
    Editor’s foreword, Special Issue on Concurrency, Fundamenta Informaticae, vol. xi, pp. 327–329. North-Holland, Amsterdam (1988)Google Scholar
  67. 67.
    Rabinovich, A., Trakhtenbrot, B.A.: Behavior structures and nets of processes, Fundamenta Informaticae, vol. xi, pp. 357–403. North-Holland, Amsterdam (1988)Google Scholar
  68. 68.
    Hirshfeld, Y., Rabinovich, A., Trakhtenbrot, B.A.: Discerning causality in interleaving behavior. In: Meyer, A.R., Taitslin, M.A. (eds.) Logic at Botik 1989. LNCS, vol. 363, pp. 146–162. Springer, Heidelberg (1989)Google Scholar
  69. 69.
    Understanding nets. In: Kreczmar, A., Mirkowska, G. (eds.) MFCS 1989. LNCS, vol. 379, pp. 133–134. Springer, Heidelberg (1989)Google Scholar
  70. 70.
    Rabinovich, A., Trakhtenbrot, B.A.: Nets of processes and data flow. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol. 354, pp. 574–602. Springer, Heidelberg (1989)CrossRefGoogle Scholar
  71. 71.
    Rabinovich, A., Trakhtenbrot, B.A.: Nets and data flow interpreters. In: Proceedings of Fourth Annual Symposium on Logic in Computer Science (LICS), Asilomar, CA, pp. 164–174 (June 1989)Google Scholar
  72. 72.
    Rabinovich, A., Trakhtenbrot, B.A.: Communication among relations. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 294–307. Springer, Heidelberg (1990)CrossRefGoogle Scholar
  73. 73.
    Mazurkiewicz, A., Rabinovich, A., Trakhtenbrot, B.A.: Connectedness and synchronization. In: Bjørner, D., Kotov, V. (eds.) Images of Programming. IFIP Series, North-Holland, Amsterdam (1991) Mazurkiewicz, A., Rabinovich, A., Trakhtenbrot, B.A.: Connectedness and synchronization. Theoretical Computer Science 90(1), 171–184 (1991)Google Scholar
  74. 74.
    Rabinovich, A., Trakhtenbrot, B.A.: On nets, algebras and modularity. In: Ito, T., Meyer, A.R. (eds.) TACS 1991. LNCS, vol. 526, pp. 176–203. Springer, Heidelberg (1991)Google Scholar
  75. 75.
    Compositional proofs for networks of processes. Fundamenta Informaticae 20, 231–275 (1994)Google Scholar
  76. 76.
    Origins and metamorphoses of the Trinity: Logic, nets, automata. In: Proceedings of the 10th IEEE Symposium on Logic in Computer Science, San Diego, pp. 506–507 (1995)Google Scholar
  77. 77.
    On the power of compositional proofs. Fundamenta Informaticae 30(1), 83–95 (1997)Google Scholar
  78. 78.
    In memory of S.A. Yanovskaya (in Russian), Researches in History of Mathematics, series 2, vol. 2(37), Russian Academy of Sciences, The Institute for History of Natural Sciences and Technology, pp. 109–127 (1997) (a) In memory of S.A. Yanovaskaya (1896–1966) on the centenary of her birth, Modern Logic 7(2), 160–187 (1997)Google Scholar
  79. 79.
    Rabinovich, A.M., Trakhtenbrot, B.A.: From finite automata toward hybrid systems. In: Chlebus, B.S., Czaja, L. (eds.) FCT 1997. LNCS, vol. 1279, pp. 411–422. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  80. 80.
    Automata and hybrid systems (seven-lecture mini-course), Technical Report no. 153, UPMAIL, Uppsala University, pp. 1–89 (1998)Google Scholar
  81. 81.
    From logic to theoretical computer science. In: Calude, C.S. (ed.) People and Ideas in Theoretical Computer Science, pp. 314–342. Springer, Heidelberg (1998)Google Scholar
  82. 82.
    Automata and their interaction: Definitional suggestions. In: Ciobanu, G., Păun, G. (eds.) FCT 1999. LNCS, vol. 1684, pp. 54–89. Springer, Heidelberg (1999)Google Scholar
  83. 83.
    Automata, circuits and hybrids: Facets of continuous time. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 4–23. Springer, Heidelberg (2001) Automata, circuits and hybrids: Facets of continuous time (Extended abstract). In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, Hersonissos, Crete, Greece, pp. 754–755 (July 2001)Google Scholar
  84. 84.
    Automata, logic, circuits: The impact of continuous time, Abstracts of the International Conference Mathematical Logic, Algebra and Set Theory, Dedicated to the 100th Anniversary of P. S. Novikov, p. 48 (August 2001)Google Scholar
  85. 85.
    Remembering Alexey Andreevich. In: Proceedings of the Conference Dedicated to the 90th Anniversary of A. A. Lyapunov, Joint Institute of Informatiques, Novosibirsk, Siberian Branch of the Russian Academy of Sciences (2001)Google Scholar
  86. 86.
    Editor’s preface, Special Issue on Continuous Time Paradigms in Logic and Automata. Fundamenta Informaticae 62(1) v–vii (2004)Google Scholar
  87. 87.
    Understanding basic automata theory in the continuous time setting. Fundamenta Informaticae, 62(1), 69–121 (2004)Google Scholar
  88. 88.
    Pardo, D., Rabinovich, A., Trakhtenbrot, B.A.: Synchronous circuits over continuous time: Feedback reliability and completeness. Fundamenta Informaticae 62(1), 123–137 (2004)zbMATHMathSciNetGoogle Scholar
  89. 89.
    In memory of Andrey Petrovich Ershov (in Russian). In: Marchuk, A.G. (ed.) Andrey Petrovich Ershov, Scientist and Man, pp. 343–351 Publishing House of Siberian Branch of the Russian Academy of Sciences (2006)Google Scholar
  90. 90.
    Avron, A., et al. (eds.): From logic to theoretical computer science. LNCS, vol. 4800. Springer, HeidelbergGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Arnon Avron
    • 1
  • Nachum Dershowitz
    • 1
  • Alexander Rabinovich
    • 1
  1. 1.No Affiliations 

Personalised recommendations