Results 51 to 60 of about 311,002 (284)
Tydskrif vir Letterkunde, 2018 The poet Boerneef (pseudonym of I. W. van der Merwe, 1897-1967) referred to his own poetry as volkspoësie (oral poetry). This is in contradistinction to the usual conception of oral literature as traditional verbal art handed down by word of mouth and ...
Wium van Zyl
doaj +1 more source
Asymptotic properties of free monoid morphisms [PDF]
, 2016 Motivated by applications in the theory of numeration systems and recognizable sets of integers, this paper deals with morphic words when erasing morphisms are taken into account. Cobham showed that if an infinite word $w =g(f^\omega(a))$ is the image of
Charlier, Emilie +2 more
core +1 more source
Advanced Robotics Research, EarlyView.Robots can learn manipulation tasks from human demonstrations. This work proposes a versatile method to identify the physical interactions that occur in a demonstration, such as sequences of different contacts and interactions with mechanical constraints.
Alex Harm Gert‐Jan Overbeek +3 more
wiley +1 more source
VISTA CONOSCENZA, PAROLA: LO “SCHEMA DEL CONTENITORE” APPLICATO A UN CASO DI POLISEMIA INDOEUROPEA
Studia Universitatis Babeş-Bolyai. Philologia, 2021 View, Knowledge, Word: The Container Image-Schema Applied to a Case of Proto-Indo-European Polysemy. The present discussion aims at reconsidering the theoretical process of knowledge in some ancient Indo-European languages in the light of the ...
Marianna POZZA
doaj +1 more source
On the combinatorics of suffix arrays [PDF]
, 2012 We prove several combinatorial properties of suffix arrays, including a characterization of suffix arrays through a bijection with a certain well-defined class of permutations. Our approach is based on the characterization of Burrows-Wheeler arrays given
Kucherov, Gregory +2 more
core +5 more sources
Automaticity of primitive words and irreducible polynomials [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Automata, Logic and Semantics If L is a language, the automaticity function A_L(n) (resp. N_L(n)) of L counts the number of states of a smallest deterministic (resp. non-deterministic) finite automaton that accepts a language that agrees with L on all inputs of length at most n.
Lacroix, Anne, Rampersad, Narad
openaire +4 more sources
Realization of a Bilayer Elastic Topological Insulator
Advanced Science, EarlyView.Bilayer elastic wave topological insulators are experimentally realized, introducing the layer degree of freedom to access four topological phases. This enables diverse domain walls and transmission behaviors, including interlayer conversion and beam splitting.
Chengzhi Ma +4 more
wiley +1 more source
WAGE: An Authenticated Encryption with a Twist
IACR Transactions on Symmetric Cryptology, 2020 This paper presents WAGE, a new lightweight sponge-based authenticated cipher whose underlying permutation is based on a 37-stage Galois NLFSR over F27.
Riham AlTawy +3 more
doaj +1 more source
In Today’s World, Anthropology is More Important than Ever [PDF]
Antropólogos Iberoamericanos en Red, 2016 After the collapse of the European colonialism in the 20th Century, the intellectual Western Word was part of a crisis, which called into questions its own concepts, methods and more fundamentally their legitimacy.
Maurice Godelier
doaj +1 more source
On the Structure of Bispecial Sturmian Words
, 2013 A balanced word is one in which any two factors of the same length contain the same number of each letter of the alphabet up to one. Finite binary balanced words are called Sturmian words.
Fici, Gabriele
core +1 more source