Search results for " Languages"
showing 10 items of 1859 documents
Journal of Baltic Linguistics
2014
Grasilda BLAŽIENĖ. Deappellativische Ortsnamen im Samland ; Trevor G. FENNELL.Pareizības kritēriji latviešu valodā: vēsturisks un mūsdienu pārskats ; Gintarė JUDŽENTYTĖ. Vietas adverbu semantikas apraksti pirmajās latviešu un lietuviešu zinātniskajās gramatikās, to attīstība ; Rolandas KREGŽDYS. Leksiniai skoliniai – tautų kultūrinės interferencijos refleksija: lietuvių kalbos polonizmai-semitizmai ; Broņislavs SPŪLIS. Vārkavas pagasta izloksne ; Baltijas studiju 10. konference Eiropā (Tallinā, 2013. gada 16.–19. jūnijā) (Laimute Balode) ; Latgalistikas konferenču turpinājums (2010–2013) (Sanita Lazdiņa, Lidija Leikuma, Nicole Nau) ; Ieva Kalniņa. Recenzija (Šuplinska, Ilga. (galv. red.) La…
Baltu filoloģija, 6
1996
Trauma and storytelling in Betty Louise Bell’s Faces in the Moon
2018
The dominant understanding of trauma as an epistemological crisis that can be mimetically passed on to readers has in the twenty-first century been criticized for its apolitical and ahistorical ori...
Verso una dimensione narrativa delle mappe
2021
Tra il pensiero e la costruzione dell’architettura il disegno ha un ruolo baricentrico per connettere i diversi protagonisti di una realizzazione e per coinvolgere la collettività facendo percepire inedite prospettive. La scrittura si rivela utile per esplicitare ciò che nella grafica è sotteso e per stabilire un ordine nuovo nel ragionamento progettuale. I rapporti fra segni e significati si moltiplicano nei sistemi informativi recenti in cui si ha la sensazione di poter dire moltissimo (dati numerici e spaziali) ma a volte sfugge quella sintesi indispensabile per una interpretazione concreta, finalizzata alla costruzione di possibili esperienze fisiche. Per l’esplorazione dell’uso di dive…
Linguistica Lettica, Nr. 14
2005
Filologu biedrības sēžu protokoli, [1932. gada 5. marts - 1944. gada 6. maijs]
1932
Protokolu beigās paraksti: Biedrības priekšnieks: E. Blese; rakstvedis: P. Ķiķauka (līdz 1935. gada. 5. oktobrim), K. Kārkliņš (no 1935. gada 2. novembra).
Research of Complex Forms in Cellular Automata by Evolutionary Algorithms
2004
This paper presents an evolutionary approach for the search for new complex cellular automata. Two evolutionary algorithms are used: the first one discovers rules supporting gliders and periodic patterns, and the second one discovers glider guns in cellular automata. An automaton allowing us to simulate AND and NOT gates is discovered. The results are a step toward the general simulation of Boolean circuits by this automaton and show that the evolutionary approach is a promising technic for searching for cellular automata that support universal computation.
A New Universal Cellular Automaton Discovered by Evolutionary Algorithms
2004
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers provides elements of answer, as it describes how another universal cellular automaton than the Game of Life (Life) was sought and found using evolutionary algorithms. This paper includes a demonstration that consists in showing that the presented R automaton can both implement any logic circuit (logic universality) and a simulation of Life (universality in the Turing sense).
On the lattice of prefix codes
2002
AbstractThe natural correspondence between prefix codes and trees is explored, generalizing the results obtained in Giammarresi et al. (Theoret. Comput. Sci. 205 (1998) 1459) for the lattice of finite trees under division and the lattice of finite maximal prefix codes. Joins and meets of prefix codes are studied in this light in connection with such concepts as finiteness, maximality and varieties of rational languages. Decidability results are obtained for several problems involving rational prefix codes, including the solution to the primeness problem.
On the decomposition of prefix codes
2017
Abstract In this paper we focus on the decomposition of rational and maximal prefix codes. We present an effective procedure that allows us to decide whether such a code is decomposable. In this case, the procedure also produces the factors of some of its decompositions. We also give partial results on the problem of deciding whether a rational maximal prefix code decomposes over a finite prefix code.