Hasil untuk "Slavic languages. Baltic languages. Albanian languages"

Jaka Čibej, Ranka Stanković, Ana Ostroški Anić et al.

Ніна [Nina] Данилюк [Danyliuk]

The Linguistic Image of the Mother of God in the Texts of Religious Songs of Book and Folk Origin This article analyses the stylistic means of verbalising the linguistic image of the Mother of God in the texts of religious songs of book and folk origin. It has been established that the image in question combines pagan ideas about the Mother Goddess and Christian beliefs in the Mother of the Son of God. The study also points out a synonymous-variant series for the designation of the Mother of God with such dominants as Virgin, Mary, Mother, Queen and Holy Protectress. As discussed, the semantics of key units is revealed through linguistic means, primarily epithets, similes and metaphors. The following peculiarities of the representation of the linguistic image of the Mother of God have been identified: in the works of book origin, the authors emphasise her divine essence, depicting her in an iconographic style; in folklore, the folk interpretation as an earthly woman prevails. The linguistic image of the Mother of God is qualified as a component of the linguistic and conceptual worldview of Ukrainians.   Językowy obraz Matki Boskiej w tekstach pieśni religijnych pochodzenia książkowego i ludowego Niniejszy artykuł analizuje środki stylistyczne użyte do werbalizacji językowego obrazu Matki Boskiej w tekstach pieśni religijnych pochodzenia książkowego i ludowego. Jak ustalono, obraz ten łączy pogańskie wyobrażenia o Bogini Matce i chrześcijańskie wierzenia w Matkę Syna Bożego. W opracowaniu wskazano również szeregi synonimiczno-wariantywne określenia Matki Boskiej z takimi dominantami, jak Dziewica, Maryja, Matka, Królowa, Święta Opiekunka. Semantyka kluczowych jednostek ujawnia się poprzez środki językowe, przede wszystkim epitety, porównania i metafory. Ustalono następującą specyfikę przedstawiania językowego obrazu Matki Boskiej: w utworach pochodzenia książkowego autorzy podkreślają jej boską istotę, przedstawiając ją w stylu ikonograficznym; w folklorze przeważa jej ludowa interpretacja jako ziemskiej niewiasty. Językowy obraz Matki Boskiej uznano za element językowego i pojęciowego obrazu świata Ukraińców. 

Attila Egri-Nagy

Programming languages tend to evolve over time to use more and more concepts from theoretical computer science. Still, there is a gap between programming and pure mathematics. Not all theoretical results have realized their promising applications. The algebraic decomposition of finite state automata (Krohn-Rhodes Theory) constructs an emulating hierarchical structure from simpler components for any computing device. These decompositions provide ways to understand and control computational processes, but so far the applications were limited to theoretical investigations. Here, we study how to apply algebraic decompositions to programming languages. We use recent results on generalizing the algebraic theory to the categorical level (from semigroups to semigroupoids) and work with the special class of concatenative functional programming languages. As a first application of semigroupoid decompositions, we start to design a family of programming languages with an explicit semigroupoid representation.

Daniel Hausmann, Mathieu Lehaut, Nir Piterman

We study how to distribute trace languages in a setting where processes communicate via reconfigurable communication channels. That is, the different processes can connect and disconnect from channels at run time. We restrict attention to communication via tree-like communication architectures. These allow channels to connect more than two processes in a way that maintains an underlying spanning tree and keeps communication continuous on the tree. We make the reconfiguration explicit in the language allowing both a centralized automaton as well as the distributed processes to share relevant information about the current communication configuration. We show that Zielonka's seminal result regarding distribution of regular languages for asynchronous automata can be generalized in this setting, incorporating both reconfiguration and more than binary tree architectures.

Yimin Zhang, Mario de Sousa

The capabilities demonstrated by Large Language Models (LLMs) inspire researchers to integrate them into industrial production and automation. In the field of Programmable Logic Controller (PLC) programming, previous researchers have focused on using LLMs to generate Structured Text (ST) language, and created automatic programming workflows based on it. The IEC 61131 graphic programming languages, which still has the most users, have however been overlooked. In this paper we explore using LLMs to generate graphic languages in ASCII art to provide assistance to engineers. Our series of experiments indicate that, contrary to what researchers usually think, it is possible to generate a correct Sequential Function Chart (SFC) for simple requirements when LLM is provided with several examples. On the other hand, generating a Ladder Diagram (LD) automatically remains a challenge even for very simple use cases. The automatic conversion between LD and SFC without extra information also fails when using prompt engineering alone.

Татьяна Ивановна Вендина

Статья посвящена анализу антропоцентрической парадигмы славянской диалектологии, современный этап которой можно с полным основанием охарактеризовать как этап становления «аналитической, объясняющей диалектологии», имеющей своей целью глубинную интерпретацию диалектного слова и сопряженный с ним анализ языка традиционной культуры. Благодаря Н. И. Толстому сформировалось новое направление в культурно-языковой диалектологии – этнолингвистика, в которой исследование диалектного слова ведется сквозь призму культурной антропологии, так как для адекватного познания языка необходимы выходы за его пределы – в философию, логику, культуру, психологию, социологию, этнологию, историю и другие области гуманитарного знания. Из лингвистики «имманентной», лингвистики «в самой себе и для себя» этнолингвистика превратилась в «зачем/почему-лингвистику» (А. Е. Кибрик), логика развития которой требует реализации общей программы антропоцентрической лингвистики – «найти доступ к человеку через язык». По мнению Н. И. Толстого, только язык может дать истинную картину языкового сознания человека той или иной культуры со всеми ее сложностями и нюансами. Опора на лингвистическую реконструкцию когнитивной структуры диалектного слова позволяет перейти от эмпирических данных к их интерпретационному анализу, т. е. подняться с уровня регистрации фактов на уровень их объяснения. Актуальность и жизненность идеи Никиты Ильича об антропологии диалектного слова доказывает и такой проект, как «Общеславянский лингвистический атлас», работа над которым началась также во многом благодаря ему. Статья поступила в редакцию 12.04.2023. Рецензирование завершено 12.04.2023. Статья принята к публикации 12.09.2023. Цитирование Вендина Т. И. Н. И. Толстой и антропология диалектного слова (к столетию со дня рождения) // Славянский альманах. 2023. No 3–4. С. 230–245. DOI: 10.31168/2073-5731.2023.3-4.11

Yevhen Redko

The article focuses on the relationships between the Ukrainian and Polish argots as part of the broader process of forming and developing East Slavic sociolects. The main attention is paid to the comparative analysis of Ukrainian lyrists’ and craftsmen’s sociolects mentioned in the academic studies during the second half of the 19th century and in the early 21st century, as well as ochweśnik jargon — the sociolect of polish peddlers, which was profoundly researched by Wanda Budziszewska in the 1950s. Lexical parallels between Ukrainian and Polish argots are analyzed by quantitative and qualitative parameters, which makes it possible, firstly, to review some traditional points about formation of the ochweśnik jargon (in particular, about the impact of the Ofenya sociolect as a basis for all East Slavic sociolects) and secondly, to articulate lexical contacts between certain sociolects and to better understand specifics of their formation and development.

Sam van der Poel, Dakotah Lambert, Kalina Kostyszyn et al.

Synthetic datasets constructed from formal languages allow fine-grained examination of the learning and generalization capabilities of machine learning systems for sequence classification. This article presents a new benchmark for machine learning systems on sequence classification called MLRegTest, which contains training, development, and test sets from 1,800 regular languages. Different kinds of formal languages represent different kinds of long-distance dependencies, and correctly identifying long-distance dependencies in sequences is a known challenge for ML systems to generalize successfully. MLRegTest organizes its languages according to their logical complexity (monadic second order, first order, propositional, or monomial expressions) and the kind of logical literals (string, tier-string, subsequence, or combinations thereof). The logical complexity and choice of literal provides a systematic way to understand different kinds of long-distance dependencies in regular languages, and therefore to understand the capacities of different ML systems to learn such long-distance dependencies. Finally, the performance of different neural networks (simple RNN, LSTM, GRU, transformer) on MLRegTest is examined. The main conclusion is that performance depends significantly on the kind of test set, the class of language, and the neural network architecture.

Peterson Yuhala, Pascal Felber, Hugo Guiroux et al.

Trusted execution environments like Intel SGX provide \emph{enclaves}, which offer strong security guarantees for applications. Running entire applications inside enclaves is possible, but this approach leads to a large trusted computing base (TCB). As such, various tools have been developed to partition programs written in languages such as C or Java into \emph{trusted} and \emph{untrusted} parts, which are run in and out of enclaves respectively. However, those tools depend on language-specific taint-analysis and partitioning techniques. They cannot be reused for other languages and there is thus a need for tools that transcend this language barrier. We address this challenge by proposing a multi-language technique to specify sensitive code or data, as well as a multi-language tool to analyse and partition the resulting programs for trusted execution environments like Intel SGX. We leverage GraalVM's Truffle framework, which provides a language-agnostic abstract syntax tree (AST) representation for programs, to provide special AST nodes called \emph{secure nodes} that encapsulate sensitive program information. Secure nodes can easily be embedded into the ASTs of a wide range of languages via Truffle's \emph{polyglot API}. Our technique includes a multi-language dynamic taint tracking tool to analyse and partition applications based on our generic secure nodes. Our extensive evaluation with micro- and macro-benchmarks shows that we can use our technique for two languages (Javascript and \python), and that partitioned programs can obtain up to $14.5\%$ performance improvement as compared to unpartitioned versions.

Mikhail Moshkov

In this paper, we study arbitrary subword-closed languages over the alphabet $\{0,1\}$ (binary subword-closed languages). For the set of words $L(n)$ of the length $n$ belonging to a binary subword-closed language $L$, we investigate the depth of decision trees solving the recognition and the membership problems deterministically and nondeterministically. In the case of recognition problem, for a given word from $L(n)$, we should recognize it using queries each of which, for some $i\in \{1,\ldots ,n\}$, returns the $i$th letter of the word. In the case of membership problem, for a given word over the alphabet $\{0,1\}$ of the length $n$, we should recognize if it belongs to the set $L(n)$ using the same queries. With the growth of $n$, the minimum depth of decision trees solving the problem of recognition deterministically is either bounded from above by a constant, or grows as a logarithm, or linearly. For other types of trees and problems (decision trees solving the problem of recognition nondeterministically, and decision trees solving the membership problem deterministically and nondeterministically), with the growth of $n$, the minimum depth of decision trees is either bounded from above by a constant or grows linearly. We study joint behavior of minimum depths of the considered four types of decision trees and describe five complexity classes of binary subword-closed languages.

Boro Sitnikovski

We present a simple programming language based on Gödel numbering and prime factorization, enhanced with explicit, scoped loops, allowing for easy program composition. Further, we will present a theorem prover that allows expressing and working with formal systems. The theorem prover is simple as it relies merely on a substitution rule and set equality to derive theorems. Finally, we will represent the programming language in the theorem prover. We will show the syntax and semantics of both, and then provide a few example programs and their evaluation.

GRZEGORZ FRANCZAK

This paper focuses on one particular aspect of the way in which 16th-century Polish authors ghostmapped the European East: the semantics assumed by the choronym “Russia” in Renaissance cartography which reflected the long‐lasting rivalry between Polish-Lithuanian Commonwealth and Muscovy for the possession of the territories of the former Kievan Rus’. After a brief sketch of the theoretical and historical framework, I provide an overview of European cartographical texts, from Beneventano to Waldseemüller and Mercator, influenced by the Polish ghostmappers of Muscovy – Wapowski, Miechowita, and Strubicz – who tried to narrow the toponym “Russia” to the lands controlled by Poland and Lithuania.

Dimitri Tokarev

The article focuses on the place occupied by one of the heroes of Demons, Alexei Kirillov, in the philosophical reflections of Alexandre Kojève and Albert Camus. While making only a few brief allusions to Kirillov during his seminar on Hegel at EPHE in 1934-1935, Kojève analyzes the “logical suicide” of this Dostoevskian character as a major argument in favour of a radical, “nihilistic”, interpretation of the notion of absolute freedom in Hegel’s Phenomenology of Spirit. There are echoes of this interpretation in The Rebel (1951), where Kirillov, already referred to in The Myth of Sisyphus (1942), is placed in a negative context related to the inevitable mutation of “philosophical suicide” into “philosophical murder”. The latter can take the form of individual terrorism or state terrorism, which is absolutely inadmissible for Camus.

Nicola Cotumaccio, Giovanna D'Agostino, Alberto Policriti et al.

In the present work, we tackle the regular language indexing problem by first studying the hierarchy of $p$-sortable languages: regular languages accepted by automata of width $p$. We show that the hierarchy is strict and does not collapse, and provide (exponential in $p$) upper and lower bounds relating the minimum widths of equivalent NFAs and DFAs. Our bounds indicate the importance of being able to index NFAs, as they enable indexing regular languages with much faster and smaller indexes. Our second contribution solves precisely this problem, optimally: we devise a polynomial-time algorithm that indexes any NFA with the optimal value $p$ for its width, without explicitly computing $p$ (NP-hard to find). In particular, this implies that we can index in polynomial time the well-studied case $p=1$ (Wheeler NFAs). More in general, in polynomial time we can build an index breaking the worst-case conditional lower bound of $Ω(|P| m)$, whenever the input NFA's width is $p \in o(\sqrt{m})$.

Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann et al.

In the Intersection Non-Emptiness problem, we are given a list of finite automata $A_1,A_2,\dots,A_m$ over a common alphabet $Σ$ as input, and the goal is to determine whether some string $w\in Σ^*$ lies in the intersection of the languages accepted by the automata in the list. We analyze the complexity of the Intersection Non-Emptiness problem under the promise that all input automata accept a language in some level of the dot-depth hierarchy, or some level of the Straubing-Thérien hierarchy. Automata accepting languages from the lowest levels of these hierarchies arise naturally in the context of model checking. We identify a dichotomy in the dot-depth hierarchy by showing that the problem is already NP-complete when all input automata accept languages of the levels zero or one half and already PSPACE-hard when all automata accept a language from the level one. Conversely, we identify a tetrachotomy in the Straubing-Thérien hierarchy. More precisely, we show that the problem is in AC$^0$ when restricted to level zero; complete for LOGSPACE or NLOGSPACE, depending on the input representation, when restricted to languages in the level one half; NP-complete when the input is given as DFAs accepting a language in from level one or three half; and finally, PSPACE-complete when the input automata accept languages in level two or higher. Moreover, we show that the proof technique used to show containment in NP for DFAs accepting languages in the Straubing-Thérien hierarchy levels one ore three half does not generalize to the context of NFAs. To prove this, we identify a family of languages that provide an exponential separation between the state complexity of general NFAs and that of partially ordered NFAs. To the best of our knowledge, this is the first superpolynomial separation between these two models of computation.

Pooja Rani, Sebastiano Panichella, Manuel Leuenberger et al.

Most software maintenance and evolution tasks require developers to understand the source code of their software systems. Software developers usually inspect class comments to gain knowledge about program behavior, regardless of the programming language they are using. Unfortunately, (i) different programming languages present language-specific code commenting notations/guidelines; and (ii) the source code of software projects often lacks comments that adequately describe the class behavior, which complicates program comprehension and evolution activities. To handle these challenges, this paper investigates the different language-specific class commenting practices of three programming languages: Python, Java, and Smalltalk. In particular, we systematically analyze the similarities and differences of the information types found in class comments of projects developed in these languages. We propose an approach that leverages two techniques, namely Natural Language Processing and Text Analysis, to automatically identify various types of information from class comments i.e., the specific types of semantic information found in class comments. To the best of our knowledge, no previous work has provided a comprehensive taxonomy of class comment types for these three programming languages with the help of a common automated approach. Our results confirm that our approach can classify frequent class comment information types with high accuracy for Python, Java, and Smalltalk programming languages. We believe this work can help to monitor and assess the quality and evolution of code comments in different program languages, and thus support maintenance and evolution tasks.

E. V. Bodrova, V. V. Kalinov

On the basis of archival materials, the issue of the construction of oil refineries set up in the USSR under lend-lease in accordance with the agreement signed with the United States in 1942 is examined, which is very relevant in the context of heightened discussions about the problems related to the history of World War II. The novelty of the research is determined not only by the introduction of new archival documents into scientific circulation, but also by an attempt to determine more precisely the reasons for the failure of the planned dates of commissioning of oil refineries. The results of the analysis of reports by American specialists are presented, which allowed to objectively consider the problems that arose during construction. Special attention is paid to the attempts of the authors of these documents to determine the main reasons for the construction slowdown. The changes in the attitude of Americans to construction managers, the management system during 1944 are commented. It is shown that their dissatisfaction with the position of consultants was expressed in the reports. It is concluded that our own production of fuel for the active army in our country was constantly growing and largely provided the front. It is proved that the commissioning of oil refineries supplied by the United States after the end of the war could not influence its outcome, but later became the basis for the creation of the refining industry in the lower Volga region.

Jorge C. Lucero

Geometric folding processes are ubiquitous in natural systems ranging from protein biochemistry to patterns of insect wings and leaves. In a previous study, a folding operation between strings of formal languages was introduced as a model of such processes. The operation was then used to define a folding system (F-system) as a construct consisting of a core language, containing the strings to be folded, and a folding procedure language, which defines how the folding is done. This paper reviews main definitions associated with F-systems and next it determines necessary conditions for a language to belong to classes generated by such systems. The conditions are stated in the form of pumping lemmas and four classes are considered, in which the core and folding procedure languages are both regular, one of them is regular and the other context-free, or both are context-free. Full demonstrations of the lemmas are provided, and the analysis is illustrated with examples.

T. A. Boronenko, V. S. Fedotova

Relevance of the work is caused by the need of professional training of masters of land management and cadastres for activity in management of land resources and real estate objects. The attention is focused on the obligation to comply with the requirements of the Federal state educational standard for the implementation of the content of educational programmes of master’s training in the electronic information and educational environment, including programmes with the use of distance learning technologies. The didactic possibilities of electronic educational resources of distance learning systems as modern multimedia and interactive means of teaching master students are characterized. The conclusion is made about possibility of improvement of methodical training of masters in “Land management and cadastres” in the field of land administration through the establishment and implementation into the pedagogical practice of an electronic educational resource of the same name. The main requirements imposed to electronic educational resources are marked: availability of methodical recommendations and thematic planning of a course; use of multimedia and interactive format of representation of electronic content of a training course; convenience of navigation on a resource; the organized feedback with the teacher; open system of estimation and control of educational activity of the trained. The results of the creation of an electronic educational resource for masters of the direction “Land management and cadastres” on the course “Management of land resources and real estate” are demonstrated. The conclusion about the prevailing positive characteristics of e-learning resources is made. The question of the need for special training and motivation of teachers to create electronic educational resources and their placing on the platform of distance learning is raised.

Arlete Cavaliere

this article aims to consider the transposition’s possibilities of Dostoiévsky’s fiction into different artistic languages such as cinema, visual arts and theater, and to understand the polyphonic and dialogic process of Dostoievsky’s discourse which allows a dynamics interaction with other artistic voices, found in different times and different spaces