Quantum Finite State Transducers

Autor: Freivalds, R., Winter, A.

Publikováno v: Proc. SOFSEM 2001, pp. 233--242, Springer, Berlin 2001.

We introduce quantum finite state transducers (qfst), and study the class of relations which they compute. It turns out that they share many features with probabilistic finite state transducers, especially regarding undecidability of emptiness (at le

Externí odkaz: http://arxiv.org/abs/quant-ph/0011052

Quantum inductive inference by finite automata

Autor: Freivalds, R., Bonner, R.F.

Publikováno v: In Theoretical Computer Science 2008 397(1):70-76

Deterministic Frequency Pushdown Automata

Autor: Calude, C. S., Freivalds, R., Jain, S., Frank Stephan

Publikováno v: JUCS-Journal of Universal Computer Science 21(12): 1563-1576
Scopus-Elsevier

A set L is (m, n)-computable iff there is a mechanism which on input of n different words produces n conjectures whether these words are in L, respectively, such that at least m of these conjectures are right. Prior studies dealt with (m, n)- computa

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bfc2b8ad5f14208c439b4cea4850d95d
https://doi.org/10.3217/jucs-021-12-1563

Coalgebraic Announcement Logics

Autor: Carreiro, F., Gorín, D., Schröder, L., Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D.

Publikováno v: Automata, Languages, and Programming ISBN: 9783642392115
ICALP (2)
Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013 : proceedings, 2, 101-112

In epistemic logic, dynamic operators describe the evolution of the knowledge of participating agents through communication, one of the most basic forms of communication being public announcement. Semantically, dynamic operators correspond to transfo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::76a60576e36b44502ef7bbedc2b509f4
https://dare.uva.nl/personal/pure/en/publications/coalgebraic-announcement-logics(6d8d158d-2575-40b8-870e-2cd26b08eae0).html

Better Approximation Schemes for Disk Graphs

Autor: Leeuwen, Erik Jan, Arge, L., Freivalds, R.

Publikováno v: Algorithm Theory – SWAT 2006 ISBN: 9783540357537
SWAT
Algorithm Theory-SWAT 2006 : 10th Scandinavian Workshop, Riga, Latvia, July 6-8, 2006 : proceedings, 316-327
STARTPAGE=316;ENDPAGE=327;TITLE=Algorithm Theory-SWAT 2006 : 10th Scandinavian Workshop, Riga, Latvia, July 6-8, 2006 : proceedings

We consider Maximum Independent Set and Minimum Vertex Cover on disk graphs. We propose an asymptotic FPTAS for Minimum Vertex Cover on disk graphs of bounded ply. This scheme can be extended to an EPTAS on arbitrary disk graphs, improving on the pre

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0dddefc54b837b26bec94b90e9f250d3
https://doi.org/10.1007/11785293_30