On the State Complexity of Ultrametric Finite Automata

Kaspars Balodis; Anda Beriņa; Kristīne Ceiziņa; Maksims Dimitrijevs; Jānis Iraids; Kārlis Jēriņš; Vladimirs Kacs; Jānis Kalējs; Rihards Krišlauks; Kārlis Lukstiņš; Reinholds Raumanis; Natālija Somova; Irina Ščeguļnaja; Anna Vanaga; Rūsiņš Mārtiņš Freivalds

On the State Complexity of Ultrametric Finite Automata

Kaspars Balodis
, Anda Beriņa
, Kristīne Ceiziņa
, Maksims Dimitrijevs
, Jānis Iraids
, Kārlis Jēriņš
, Vladimirs Kacs
, Jānis Kalējs
, Rihards Krišlauks
, Kārlis Lukstiņš
, Reinholds Raumanis
, Natālija Somova
, Irina Ščeguļnaja
, Anna Vanaga
, Rūsiņš Mārtiņš Freivalds

University of Latvia

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

Original language	German
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	1-9
Volume	2
Publication status	Published - 2013

OECD Field of Science

1.2 Computer and Information Sciences

Cite this

Balodis, K., Beriņa, A., Ceiziņa, K., Dimitrijevs, M., Iraids, J., Jēriņš, K., Kacs, V., Kalējs, J., Krišlauks, R., Lukstiņš, K., Raumanis, R., Somova, N., Ščeguļnaja, I., Vanaga, A., & Freivalds, R. M. (2013). On the State Complexity of Ultrametric Finite Automata. 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. 1-9)

@inproceedings{5bf99cea02ee4dc2b5bec5362c37ef46,

title = "On the State Complexity of Ultrametric Finite Automata",

author = "Kaspars Balodis and Anda Beriņa and Kristīne Ceiziņa and Maksims Dimitrijevs and Jānis Iraids and Kārlis Jēriņ{\v s} and Vladimirs Kacs and Jānis Kalējs and Rihards Kri{\v s}lauks and Kārlis Lukstiņ{\v s} and Reinholds Raumanis and Natālija Somova and Irina {\v S}{\v c}eguļnaja and Anna Vanaga and Freivalds, \{Rūsiņ{\v s} Mārtiņ{\v s}\}",

year = "2013",

language = "Vācu",

isbn = "9788087136157",

volume = "2",

pages = "1--9",

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, Beriņa, A, Ceiziņa, K, Dimitrijevs, M , Iraids, J, Jēriņš, K, Kacs, V, Kalējs, J, Krišlauks, R, Lukstiņš, K, Raumanis, R, Somova, N, Ščeguļnaja, I, Vanaga, A & Freivalds, RM 2013, On the State Complexity of Ultrametric Finite Automata. 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. 1-9.

On the State Complexity of Ultrametric Finite Automata. / Balodis, Kaspars; Beriņa, Anda; Ceiziņa, Kristīne 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. 1-9.

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

TY - GEN

T1 - On the State Complexity of Ultrametric Finite Automata

AU - Balodis, Kaspars

AU - Beriņa, Anda

AU - Ceiziņa, Kristīne

AU - Dimitrijevs, Maksims

AU - Iraids, Jānis

AU - Jēriņš, Kārlis

AU - Kacs, Vladimirs

AU - Kalējs, Jānis

AU - Krišlauks, Rihards

AU - Lukstiņš, Kārlis

AU - Raumanis, Reinholds

AU - Somova, Natālija

AU - Ščeguļnaja, Irina

AU - Vanaga, Anna

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

PY - 2013

Y1 - 2013

M3 - Konferences zinātniskais raksts

SN - 9788087136157

VL - 2

SP - 1

EP - 9

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, Beriņa A, Ceiziņa K, Dimitrijevs M , Iraids J, Jēriņš K et al. On the State Complexity of Ultrametric Finite Automata. 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. 1-9