Search results for "R language"

Words and Patterns

2002

In this paper some new ideas, problems and results on patterns are proposed. In particular, motivated by questions concerning avoidability, we first study the set of binary patterns that can occur in one infinite binary word, comparing it with the set of factors of the word. This suggests a classification of infinite words in terms of the "difference" between the set of its patterns and the set of its factors. The fact that each factor in an infinite word can give rise to several distinct patterns leads to study the set of patterns of a single finite word. This set, endowed with a natural order relation, defines a poset: we investigate the relationships between the structure of such a poset…

О постановкѣ научнаго китаевѣдѣнія въ Западной Европѣ [О постановке научного китаеведения в Западной Европе]

1908

Извлечение из протокола заседания Конференции Восточного Института 9 февраля 1908 года.

Senķīniešu vēsturnieka sniegtās ziņas par Āzijas huņņiem

2015

Linguistica Lettica, Nr. 17

2008

XIII Starptautiskais baltistu kongress „Baltu valodas laikā un telpā”: Referātu tēzes

2021

2021. gada 13.–15. oktobrī Latvijas Universitāte tiešsaistē organizēja XIII Starptautisko baltistu kongresu “Baltu valodas laikā un telpā”, kurā piedalījās vairāk nekā 170 dalībnieku no 11 valstīm. Kongresa aizsākumi meklējami 1965. gadā, kad Viļņas universitātes Lietuviešu valodas katedras un Lietuviešu valodas institūta darbinieki sarīkoja baltu valodu vēsturei veltītu konferenci. Starptautiskais baltistu kongress ik pēc pieciem gadiem pārmaiņus notiek Viļņā vai Rīgā. Kongresa tēžu krājumā apvienots plašs tēmu loks, sākot no baltu valodu likteņiem laika nogriežņos (diahronijā), līdz skatījumam uz valodu pašreizējā stāvoklī (sinhronijā): valodas vēsture, gramatika, onomastika, sociolingvis…

Linguistica Lettica, Nr. 27

2019

Interrogative Clauses across CEFR Levels in Finnish and Swedish as an L2

2014

The present study investigates the frequency of three types of interrogative clauses in 329 semi-formal email messages written by language learners of Finnish and of Swedish spoken in Finland. All the written messages were assessed according to the Common European Framework of Reference by trained language professionals. The study is part of a larger research project, Topling, conducted at the University of Jyväskylä. For the purpose of the study, the interrogative clauses were divided into three categories: yes/no questions, wh-questions and subordinate interrogative clauses. We examined the frequencies according to the levels of language proficiency. The findings show that, in both langua…

On the impact of forgetting on learning machines

1995

People tend not to have perfect memories when it comes to learning, or to anything else for that matter. Most formal studies of learning, however, assume a perfect memory. Some approaches have restricted the number of items that could be retained. We introduce a complexity theoretic accounting of memory utilization by learning machines. In our new model, memory is measured in bits as a function of the size of the input. There is a hierarchy of learnability based on increasing memory allotment. The lower bound results are proved using an unusual combination of pumping and mutual recursion theorem arguments. For technical reasons, it was necessary to consider two types of memory : long and sh…

Quantum Computers and Quantum Automata

2000

Quantum computation is a most challenging project involving research both by physicists and computer scientists. The principles of quantum computation differ from the principles of classical computation very much. When quantum computers become available, the public-key cryptography will change radically. It is no exaggeration to assert that building a quantum computer means building a universal code-breaking machine. Quantum finite automata are expected to appear much sooner. They do not generalize deterministic finite automata. Their capabilities are incomparable.

Tally languages accepted by Monte Carlo pushdown automata

1997

Rather often difficult (and sometimes even undecidable) problems become easily decidable for tally languages, i.e. for languages in a single-letter alphabet. For instance, the class of languages recognizable by 1-way nondeterministic pushdown automata equals the class of the context-free languages, but the class of the tally languages recognizable by 1-way nondeterministic pushdown automata, contains only regular languages [LP81]. We prove that languages over one-letter alphabet accepted by randomized one-way 1-tape Monte Carlo pushdown automata are regular. However Monte Carlo pushdown automata can be much more concise than deterministic 1-way finite state automata.