Search results for "languages"

LETTER TO THE EDITOR. CUNICULUS 'RABBIT' - A CELTIC ETYMOLOGY

2010

Den kultur- och litteraturhistoriska gestalten i den lettiska novellen “Svētā Briģita” (“Heliga Birgitta”) av Jānis Ezeriņš

2019

Cultural-historical and literary gestalt in the Latvian short story “Saint Birgitta” (“Heliga Birgitta”) by Jānis EzeriņšThe Latvian author Jānis Ezeriņš’s (1891–1924) literary heritage includes, among other texts, the collection of short stories Fantastiska novele un citas (Fantastic short story and others, 1923). The collection contains the short story “Svētā Briģita” (“Saint Birgitta”), in which the author has used the image of a saint, which is very well known in the history of culture, literature and religion. The image can be related both to Celtic mythology and the historical Swedish personality, who had been the founder of Vadstena monastery and a literary author herself (approx. 13…

Adding symbolic information to picture models: definitions and properties

2005

AbstractIn the paper we propose extensions of some picture models, such as colored, drawn and pixel pictures. Such extensions are conceived by observing that a picture may embed more information than the shape, such as colors, labels, etc., which can be represented by a symbol from an alphabet and can be associated to segments, points or pixels. New interesting issues derived from the introduction of symbols will be investigated together with some complexity and decidability questions for the proposed extensions.

Form factors of the isovector scalar current and the ηπ scattering phase shifts

2015

33 pages.- 14 figures.- v2: Some clarifications and corrections of typos

Raons essencials i creença

2003

In this paper I defend that what I call modes of denotation are part of one¿s belief content, even if they are not part of the proposition expressed by the sentence one believes to be true. Two people, who believe of the same sentence (not ambiguous) that it is true can have different belief contents that they express by means of this same sentence.

Context-free Languages

1988

In this chapter we shall define a class of rewriting systems called context-free grammars. The left-hand side of a rule in a context-free grammar consists of a single symbol, so that symbols are rewritten “context-freely”. Context-free grammars are of central importance to us because they define the class of context-free languages, the parsing of which is the subject of this book. In this chapter we shall consider some structural properties of context-free grammars which are of importance in parsing. Also, a basic method for recognizing context-free languages will be given.

Pseudocomplements in sum-ordered partial semirings

2007

We study a particular way of introducing pseudocomplementation in ordered semigroups with zero, and characterise the class of those pseudocomplemented semigroups, termed g-semigroups here, that admit a Glivenko type theorem (the pseudocomplements form a Boolean algebra). Some further results are obtained for g-semirings – those sum-ordered partially additive semirings whose multiplicative part is a g-semigroup. In particular, we introduce the notion of a partial Stone semiring and show that several well-known elementary characteristics of Stone algebras have analogues for such semirings.

On a class of languages with holonomic generating functions

2017

We define a class of languages (RCM) obtained by considering Regular languages, linear Constraints on the number of occurrences of symbols and Morphisms. The class RCM presents some interesting closure properties, and contains languages with holonomic generating functions. As a matter of fact, RCM is related to one-way 1-reversal bounded k-counter machines and also to Parikh automata on letters. Indeed, RCM is contained in L-NFCM but not in L-DFCM, and strictly includes L-CPA. We conjecture that L-DFCM subset of RCM

On Horn spectra

1991

Abstract A Horn spectrum is a spectrum of a Horn sentence. We show that to solve Asser's problem, and consequently the EXPTIME = ? NEXPTIME question it suffices to consider the class of Horn spectra. We also pose the problem whether or not the generator of every Horn spectrum is a spectrum. We prove that from a negative solution of the generator problem, a negative answer for the EXPTIME = ? NEXPTIME question follows. Some other relations between the generator problem and Asser's problem are given. Finally, the relativized version of the generator problem is formulated and it is shown that it has an affirmative solution for some oracles, and a negative solution for some others.

A lower bound for the Bloch radius of 𝐾-quasiregular mappings

2004

We give a quantitative proof to Eremenko’s theorem (2000), which extends Bloch’s classical theorem to the class of n n -dimensional K K -quasiregular mappings.