Search results for " Languages"
showing 10 items of 1859 documents
Korejiešu valoda latviešiem, 1.daļa: 24.audiodatne
2017
Korejiešu valodas mācību grāmatas 1. daļas audiodatne 24
Korejiešu valoda latviešiem, 3.daļa: 2.audiodatne
2020
Korejiešu valodas mācību grāmatas 3. daļas audiodatne 2
Korejiešu valoda latviešiem, 2.daļa: 41.audiodatne
2019
Korejiešu valodas mācību grāmatas 2. daļas audiodatne 41
Korejiešu valoda latviešiem, 3.daļa: 42.audiodatne
2020
Korejiešu valodas mācību grāmatas 3. daļas audiodatne 42
Korejiešu valoda latviešiem, 3.daļa: 15.audiodatne
2020
Korejiešu valodas mācību grāmatas 3. daļas audiodatne 15
Latviešu-krievu vārdnīca : [rokrakstā]
1889
Uz manuskripta autora-sastādītāja paraksta nav. Manuskripts sākotnēji piedēvēts J. Lautenbaham-Jūsmiņam, kurš ir veicis vārdnīcas rediģēšanu.
Representation of Autonomous Automata
2001
An autonomous automaton is a finite automaton with output in which the input alphabet has cardinality one when special reduced. We define the transition from automata to semigroups via a representation successful if given two incomparable automata (neither simulate the other), the semigroups representing the automata are distinct. We show that representation by the transition semigroup is not successful. We then consider a representation of automata by semigroups of partial transformations. We show that in general transition from automata to semigroups by this representation is not successful either. In fact, the only successful transition presented is the transiton to this semigroup of par…
Minimal Forbidden Factors of Circular Words
2017
Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two factorial languages are distinct if and only if they have different (antifactorial) sets of minimal forbidden factors. There exist algorithms for computing the minimal forbidden factors of a word, as well as of a regular factorial language. Conversely, Crochemore et al.ÃÂ [IPL, 1998] gave an algorithm that, given the trie recognizing a finite antifactorial language M, computes a DFA of the language having M as set of minimal forbidden factors. In the same paper, they showed that the obtained DFA is minimal if the input trie recognizes the minimal forbidden factors of a single word. We gener…
Resolution of singularities for multi-loop integrals
2007
We report on a program for the numerical evaluation of divergent multi-loop integrals. The program is based on iterated sector decomposition. We improve the original algorithm of Binoth and Heinrich such that the program is guaranteed to terminate. The program can be used to compute numerically the Laurent expansion of divergent multi-loop integrals regulated by dimensional regularisation. The symbolic and the numerical steps of the algorithm are combined into one program.
Newcomers Navigating Language Choice and Seeking Voice: Peer Talk in a Multilingual Primary School Classroom in Finland
2013
This article investigates how two young newcomers navigate an institutional policy of “English only” in a Finnish primary school and how this policy impacts opportunities for voice. From a discourse analytic and sociolinguistic perspective, the analysis takes an ethnographic path to a focal event of language conflict in the classroom. The analysis reveals that these two learners negotiate more powerful voices for themselves, despite responding differently to normative practices for code use in the classroom.