Zur Hauptnavigation Zum Inhaltsbereich Zur Suche Zum Seitenfu├č


Project : Small Universal Turing Machines

Diese Seite ist auch in Deutsch verfügbar. Cette page existe aussi en Français. Ésta página también existe en Español. Această pagină este disponibilă şi în limba
                  Română


Prof. Dr. Kudlek, professor
Prof. Dr. Maurice Margenstern (Metz, Paris)
Prof. Dr. Pál Dömösi (Debrecen)
Prof. Dr. Yuri Rogozhin (Chisinau)
Ludmila Pavlockaya (Moskau)

Duration: since 1980

Keywords: Universal Turing Machines

Objectives:

Investigation of the border between decidability and undecidability. On one side there are small universal Turing machines, all smallest have been constructed by Y. Rogozhin. All of them have exponential complexity for representation and simulation of special machines. Investigation of this relation bewtween size and complexity.

Investigation of universal machines with complexity constraint in space and time, especially for a subclass of primitive recursive functions as complexity constraint. For finite state automata there are no universal machines of the same kind. Universal Circular Post machines are considered and constructed, too.

Publications:

  1. Volker Diekert, Manfred Kudlek
    Small Deterministic Turing Machines
    (Papers on Automata and Languages, Department of Mathematics, Karl Marx University of Economics, Budapest, 1988-4, pp. 77-87, 1989)
  2. Manfred Kudlek
    Small Deterministic Turing Machines
    (TCS 168 (2), pp. 241-255, 1996)
  3. Manfred Kudlek, Maurice Margenstern
    Universal Turing Machines with Complexity Constraints
    (Proceedings of the International Conference Automata and Formal Languages VIII, Publ. Math. Debrecen 53, pp. 895-904, 1999)
  4. Manfred Kudlek
    On Universal Finite Automata and a-Transducers
    (In: Grammars and Automata for String Processing: from Mathematics and Computer Science to Biology and back . Eds. C. Martín Vide, V. Mitrana, Topics in Computer Mathematics , pp. 163-170, Taylor and Francis, London, 2003)
  5. Manfred Kudlek, Yurii Rogozhin
    Small Universal Circular Post Machines
    (Computer Science Journal of Moldova, Vol. 9, Nr. 1, pp. 34-52, 2001)
  6. Manfred Kudlek, Yurii Rogozhin
    A New Small Universal Turing Machine
    (Preproceedings of DLT'2001, ed. W. Kuich, pp. 323-332, TU Wien, 2001)
  7. Manfred Kudlek, Yurii Rogozhin
    New Small Universal Circular Post Machines
    (Proceedings of FCT'2001, ed. R. Freivalds, LNCS 2138, pp. 217-226, 2001)
  8. Manfred Kudlek, Yurii Rogozhin
    A Universal Turing Machine with 3 States and 9 Symbols
    (Proceedings of DLT'2001, eds. W. Kuich, G. Rozenberg, A. Salomaa, LNCS 2295, pp. 311-318, 2002)
  9. Manfred Kudlek, Yurii Rogozhin
    Small Universal Turing and Circular Post Machines
    (PU.M.A., vol. 13, no. 1-2, pp. 197-210, 2003)
  10. Artiom Alhazov, Manfred Kudlek, Yurii Rogozhin
    Nine Universal Circular Post Machines
    (Computer Science Journal of Moldova, vol. 11, pp. 247-262, 2002)
  11. Manfred Kudlek
    Some Considerations on Universality
    (Proc. of CSP08, eds. N. Murphy, T. Neary, A. Seda, D. Woods, pp. 149-155, 2008)
  12. Manfred Kudlek
    Some Considerations on Universality
    (EPTCS 1, pp. 118-122, 2009)

Last Change: 17:40 05/19/2011
Imprint/Disclaimer