Zobrazeno 1 - 10
of 79
pro vyhledávání: '"Rusins Freivalds"'
Publikováno v:
Theoretical Computer Science. 609:272-285
Ehrenfeucht, Parikh and Rozenberg gave an interesting characterisation of the regular languages called the block pumping property. When requiring this property only with respect to members of the language but not with respect to nonmembers, one gets
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe3339e10bdbfcdee1f7a740533738f1
https://doi.org/10.1016/j.tcs.2015.10.008
https://doi.org/10.1016/j.tcs.2015.10.008
Autor:
Rusins Freivalds
Publikováno v:
EPiC Series in Computing.
We introduce a notion of ultrametric automata and Turing machines using p-adic numbers to describe random branching of the process of computation. These automata have properties similar to the properties of probabilistic automata but complexity of pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::734ee4e8901593b4a89304c1542ec7c8
https://doi.org/10.29007/tdf5
https://doi.org/10.29007/tdf5
Autor:
Rusins Freivalds, Solvita Zarina
Publikováno v:
Baltic Journal of Modern Computing. 4
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::77de35e7ee57f77c332174489f6941fe
https://doi.org/10.22364/bjmc.2016.4.4.02
https://doi.org/10.22364/bjmc.2016.4.4.02
Autor:
Richard F. Bonner, Rusins Freivalds
Publikováno v:
Theoretical Computer Science. 397:70-76
Freivalds and Smith [R. Freivalds, C.H. Smith Memory limited inductive inference machines, Springer Lecture Notes in Computer Science 621 (1992) 19–29] proved that probabilistic limited memory inductive inference machines can learn with probability
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::48541d8e5779e8ecd45ff50d1a3139a1
https://doi.org/10.1016/j.tcs.2008.02.023
https://doi.org/10.1016/j.tcs.2008.02.023
Computing with New Resources : Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday
Professor Jozef Gruska is a well known computer scientist for his many and broad results. He was the father of theoretical computer science research in Czechoslovakia and among the first Slovak programmers in the early 1960s. Jozef Gruska introduced
This two-volume set of LNCS 7965 and LNCS 7966 constitutes the refereed proceedings of the 40th International Colloquium on Automata, Languages and Programming, ICALP 2013, held in Riga, Latvia, in July 2013. The total of 124 revised full papers pres
Publikováno v:
Journal of Experimental & Theoretical Artificial Intelligence. 11:543-552
The functions of finite support have played a ubiquitous role in the study of inductive inference since its inception. In addition to providing a clear and simple example of a learnable class, the functions of finite support are employed in many proo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::430cc315c4fbf4cccae8daf091cf612a
https://doi.org/10.1080/095281399146418
https://doi.org/10.1080/095281399146418
Publikováno v:
Annals of Mathematics and Artificial Intelligence. 23:199-209
A new identification type close to the identification of minimal Godel numbers is considered. The type is defined by allowing as input both the graph of the target function and an arbitrary upper bound of the minimal index of the target function in a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c9bc0d6187d1f8ac2f661f276ec60581
https://doi.org/10.1023/a:1018920425684
https://doi.org/10.1023/a:1018920425684
Autor:
Sanjay Jain, Rusins Freivalds
Publikováno v:
Theoretical Computer Science. 188:175-194
Identification of programs for computable functions from their graphs by algorithmic devices is a well studied problem in learning theory. Freivalds and Chen consider identification of ‘minimal’ and ‘nearly minimal’ programs for functions fro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fb39813f80a67b9fc7b35c5cb456459d
https://doi.org/10.1016/s0304-3975(96)00295-2
https://doi.org/10.1016/s0304-3975(96)00295-2
Publikováno v:
Information and Computation. 129(1):53-62
Previous work in inductive inference dealt mostly with finding one or several machines (IIMs) that successfully learn collections of functions. Herein we start with a class of functions and considerthe learner setof all IIMs that are successful at le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ebe1c2f531cc1911c128a76f461e82a9