Ultrametric Turing Machines with Limited Reversal Complexity

Kaspars Balodis; Rihards Krišlauks; Ieva Rukšāne; Iļja Kucevalovs; Rūsiņš Mārtiņš Freivalds; Ieva Nāgele

Ultrametric Turing Machines with Limited Reversal Complexity

Kaspars Balodis
, Rihards Krišlauks
, Ieva Rukšāne
, Iļja Kucevalovs
, Rūsiņš Mārtiņš Freivalds
, Ieva Nāgele

University of Latvia

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › Research › peer-review

Original language	English
Title of host publication	SOFSEM 2013: Theory and Practice of Computer Science : 39th International Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv, Mlyn, Czech Republic, January 26-31, 2013 : Proceedings.
Pages	87-94
Volume	2
Publication status	Published - 2013

OECD Field of Science

1.2 Computer and Information Sciences

Cite this

Balodis, K., Krišlauks, R., Rukšāne, I., Kucevalovs, I., Freivalds, R. M., & Nāgele, I. (2013). Ultrametric Turing Machines with Limited Reversal Complexity. In SOFSEM 2013: Theory and Practice of Computer Science : 39th International Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv, Mlyn, Czech Republic, January 26-31, 2013 : Proceedings. (Vol. 2, pp. 87-94)

@inproceedings{0abc64f1a5eb45ee86a4829de02a953c,

title = "Ultrametric Turing Machines with Limited Reversal Complexity",

author = "Kaspars Balodis and Rihards Kri{\v s}lauks and Ieva Ruk{\v s}āne and Iļja Kucevalovs and Freivalds, \{Rūsiņ{\v s} Mārtiņ{\v s}\} and Ieva Nāgele",

year = "2013",

language = "English",

isbn = "9788087136157",

volume = "2",

pages = "87--94",

booktitle = "SOFSEM 2013: Theory and Practice of Computer Science : 39th International Conference on Current Trends in Theory and Practice of Computer Science, {\v S}pindleruv, Mlyn, Czech Republic, January 26-31, 2013 : Proceedings.",

}

Balodis, K, Krišlauks, R, Rukšāne, I, Kucevalovs, I, Freivalds, RM & Nāgele, I 2013, Ultrametric Turing Machines with Limited Reversal Complexity. in SOFSEM 2013: Theory and Practice of Computer Science : 39th International Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv, Mlyn, Czech Republic, January 26-31, 2013 : Proceedings.. vol. 2, pp. 87-94.

Ultrametric Turing Machines with Limited Reversal Complexity. / Balodis, Kaspars; Krišlauks, Rihards; Rukšāne, Ieva et al.
SOFSEM 2013: Theory and Practice of Computer Science : 39th International Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv, Mlyn, Czech Republic, January 26-31, 2013 : Proceedings.. Vol. 2 2013. p. 87-94.

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › Research › peer-review

TY - GEN

T1 - Ultrametric Turing Machines with Limited Reversal Complexity

AU - Balodis, Kaspars

AU - Krišlauks, Rihards

AU - Rukšāne, Ieva

AU - Kucevalovs, Iļja

AU - Freivalds, Rūsiņš Mārtiņš

AU - Nāgele, Ieva

PY - 2013

Y1 - 2013

M3 - Conference paper

SN - 9788087136157

VL - 2

SP - 87

EP - 94

BT - SOFSEM 2013: Theory and Practice of Computer Science : 39th International Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv, Mlyn, Czech Republic, January 26-31, 2013 : Proceedings.

ER -

Balodis K, Krišlauks R, Rukšāne I, Kucevalovs I, Freivalds RM, Nāgele I. Ultrametric Turing Machines with Limited Reversal Complexity. In SOFSEM 2013: Theory and Practice of Computer Science : 39th International Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv, Mlyn, Czech Republic, January 26-31, 2013 : Proceedings.. Vol. 2. 2013. p. 87-94