Search results for "Alphabet"
showing 10 items of 68 documents
Word assembly through minimal forbidden words
2006
AbstractWe give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of constant size starting from a finite set of factors of w verifying a suitable hypothesis. We use combinatorics techniques based on the minimal forbidden words, which have been introduced in previous papers. This improves a previous algorithm which worked under the assumption of stronger hypothesis.
Language in Central Europe: An Overview
2009
The linguistic picture of Central Europe, as we know it, started forming in the 6th to 9th centuries. The coming of the Slavs (or rather the spread of their language and way of life to unrelated various ethnic groups) marks the beginning of this caesura that largely closed in 896 AD when the Magyars crossed the Carpathians into Pannonia. This event gradually divided the hypothetically continuous area of Slavic settlement into a southern section, extending from contemporary Slovenia to Bulgaria, and into a northern section, which coincided with the areas from the Elbe in today’s eastern Germany to the upper Volga in northeastern Russia. In the west, the Magyar-speakers skirted the East and …
Feynman integrals and iterated integrals of modular forms
2017
In this paper we show that certain Feynman integrals can be expressed as linear combinations of iterated integrals of modular forms to all orders in the dimensional regularisation parameter $\varepsilon$ . We discuss explicitly the equal mass sunrise integral and the kite integral. For both cases we give the alphabet of letters occurring in the iterated integrals. For the sunrise integral we present a compact formula, expressing this integral to all orders in $\varepsilon$ as iterated integrals of modular forms.
Alphabet as a pretext. Representation and architecture starting from J.D. Steingruber
2020
Johann David Steingruber (1702-87) realizzò nel 1773 l’ “Alfabeto Architettonico” (titolo originale “Architektonisches Alphabeth bestehend aus 30 Rissen”),ovvero un compendio di edifici immaginari le cui piante presentano la forma delle lettere dell’alfabeto. A partire dall’analisi delle tavole, obiettivo del contributo è presentare una riflessione su questi disegni, sia in relazione alle intrinseche caratteristiche storiche ed estetiche, sia in relazione alla personalità dello Steingruber. Johann David Steingruber (1702-87) realized in 1773 the “Architectural Alphabet” (original title “Architektonisches Alphabeth bestehend aus 30 Rissen”), that is a compendium of imaginary buildings with p…
The role of informal learning in adults' literacy proficiency
2021
This study used the Programme for International Assessment of Adult Competencies (PIAAC) dataset to examine informal literacy learning’s effects on adults’ literacy proficiency. Also, the factors associated with informal literacy learning at and outside of work were studied. The study participants were Nordic adults aged 35–65 years. The statistical method was regression analysis, and the results indicate that informal literacy activities at work are associated primarily with occupation, and informal literacy activities outside of work with education, parents’ education and gender. Initial education, occupation, language background and age exerted the strongest estimated associations with r…
Runology and historical sociolinguistics: On runic writing and its social history in the first millennium
2015
AbstractThis paper argues that the rise and the transmission of the runes is largely determined by sociolinguistic factors. First, the olderfuþarkis identified as a unique Germanic design, adapted from Latin or Greek sources by one or more well-born Germani to mark group identity and status. Hence it is rather unlikely that the search for an exact source alphabet of the olderfuþarkwill make a major breakthrough in future research. Second, the present author argues that the extension of thefuþarkin the Anglo-Frisian setting is due to high-scale contact with the Christian Church, including Latin manuscript culture and Classical grammatical schooling, whereas these factors were almost entirely…
THE KNOT SCRIPT – THE LOST WRITING SYSTEM OF THE LATVIAN LANGUAGE
2016
The article analyses a writing system of the Latvian language that has been scarcely researched before. The evidence of the usage of the knot script and song clews is present in the Latvian folklore, although it has been commonly considered as a metaphor. At the beginning of the 20th century there were individuals still using it prior to the conventional literacy increase due to the general education. Similar knot scripts can be found in several cultures around the globe. The article encompasses a study of previous researches and evidence in periodicals, Latvian community in Lithuania, education of commoners in Latvia, reciprocal comparison of the Latvian knot script writing systems, interv…
An optimal code for patient identifiers.
2004
How to distinguish 1 billion individuals by an identifier consisting of eight characters, allowing a reasonable amount of error detection or even error correction? Our solution of this problem is an optimal code over a 32-character alphabet that detects up to two errors and corrects one error as well as a transposition of two adjacent characters. The corresponding encoding and error checking algorithms are available for free; they are also embedded as components of the pseudonymisation service that is used in the TMF-the German telematics platform for health research networks.
Minimal Absent Words in Rooted and Unrooted Trees
2019
We extend the theory of minimal absent words to (rooted and unrooted) trees, having edges labeled by letters from an alphabet \(\varSigma \) of cardinality \(\sigma \). We show that the set \(\text {MAW}(T)\) of minimal absent words of a rooted (resp. unrooted) tree T with n nodes has cardinality \(O(n\sigma )\) (resp. \(O(n^{2}\sigma )\)), and we show that these bounds are realized. Then, we exhibit algorithms to compute all minimal absent words in a rooted (resp. unrooted) tree in output-sensitive time \(O(n+|\text {MAW}(T)|)\) (resp. \(O(n^{2}+|\text {MAW}(T)|)\) assuming an integer alphabet of size polynomial in n.
Some Decision Results on Nonrepetitive Words
1985
The paper addresses some generalizations of the Thue Problem such as: given a word u, does there exist an infinite nonrepetitive overlap free (or square free) word having u as a prefix? A solution to this as well as to related problems is given for the case of overlap free words on a binary alphabet.