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

Antoine Amarilli, Sven Dziadek, Luc Segoufin

For a fixed regular language $L$, the enumeration of $L$-infixes is the following task: we are given an input word $w = a_1 \cdots a_n$ and we must enumerate the infixes of $w$ that belong to $L$, i.e., the pairs $i \leq j$ such that $a_i \cdots a_j \in L$. We are interested in dynamic enumeration of $L$-infixes, where we must additionally support letter substitution updates on $w$ (e.g., "replace the $i$-th letter of $w$ by a letter $a$"). Each update changes the set of infixes to enumerate, and resets the enumeration state. We study for which regular languages $L$ we can perform dynamic enumeration of $L$-infixes in constant delay (i.e., the next infix is always produced in constant time) and constant additional memory throughout the enumeration, while supporting each update in constant time. We show that, for languages $L$ with a neutral letter, if the language $L$ belongs to the class ZG and is extensible (i.e., if $u \in L$ and $u$ is a factor of $v$ then $v \in L$), then dynamic enumeration of $L$-infixes can be achieved with a simple algorithm that ensures constant-time updates and constant delay, but not constant additional memory. Our main contribution is then to show an algorithm that additionally uses only constant additional memory, and applies to a more general class of semi-extensible ZG languages for which we give several equivalent characterizations. We further discuss whether our results can be generalized to larger language classes and show some (conditional) lower bounds.

N. O. Ilina, M. E. Lyapidovskaya, E. V. Busurina

This article provides an in-depth examination of the urbanonyms that have emerged in St. Petersburg and the Leningrad Region between 2002 and 2024. The primary sources for this study are the minutes from the meetings of the Toponymic Commission, resulting in an analysis of a total of 996 entries. The authors propose a classification system for urbanonyms based on various motivational criteria, including notable individuals and events commemorated by these names, urban infrastructure elements, as well as geographical features and natural landscapes. The paper identifies and analyzes trends in the formation of the city’s toponymic landscape, taking into account the sociocultural specificity of the newly established urbanonyms. It emphasizes the connection between urbanonyms as markers of sociocultural identity and the processes of historical and cultural memory preservation within urban spaces. The study demonstrates that this urban environment is characterized by trends such as the use of Finno-Ugric and Ingrian names, the restoration of lost names, an ensemble approach to naming closely situated entities, and folk traditions of naming based on churches and temples. The authors conclude that the predominance of urbanonyms associated with culture, military events, and science underscores the significance of these domains for the city.

A. A. Afaunova, N. G. Sherieva

This study investigates the Mozdok and Besleneev dialects of the Kabardino-Circassian language. The article presents the findings of a comparative analysis of these dialects, focusing on their similarities and differences in relation to each other and to the literary language. The research draws on the works of prominent Caucasian scholars who have explored this topic. New recordings of speech from speakers of both dialects, collected between 2022 and 2024 in their respective regions, serve as primary data sources. Special attention is given to the consonantal inventory, where consonants absent in the literary language but phonetically similar in the studied dialects are identified. The relevance of this work stems from the pressing need to examine the contemporary state of these variants of the Kabardino-Circassian language through the collection and analysis of new field data. The novelty of the study lies in its re-evaluation of dialectal features of the Kabardino-Circassian language variants for the first time in several decades. It is demonstrated that the examined dialects employ several sounds that are phonetically similar substitutes for literary forms: чI [ch’], чIъ [ch], щIъ [sh] instead of щI [sh’], г (g) instead of дж [dz], жь [zh’] instead of ж [zh], among others. Additionally, each dialect exhibits its own specific properties in the use of consonant sounds.

Charles Pert, Dalal Alrajeh, Alessandra Russo

Büchi automata (BAs) recognize $ω$-regular languages defined by formal specifications like linear temporal logic (LTL) and are commonly used in the verification of reactive systems. However, BAs face scalability challenges when handling and manipulating complex system behaviors. As neural networks are increasingly used to address these scalability challenges in areas like model checking, investigating their ability to generalize beyond training data becomes necessary. This work presents the first study investigating whether recurrent neural networks (RNNs) can generalize to $ω$-regular languages derived from LTL formulas. We train RNNs on ultimately periodic $ω$-word sequences to replicate target BA behavior and evaluate how well they generalize to out-of-distribution sequences. Through experiments on LTL formulas corresponding to deterministic automata of varying structural complexity, from 3 to over 100 states, we show that RNNs achieve high accuracy on their target $ω$-regular languages when evaluated on sequences up to $8 \times$ longer than training examples, with $92.6\%$ of tasks achieving perfect or near-perfect generalization. These results establish the feasibility of neural approaches for learning complex $ω$-regular languages, suggesting their potential as components in neurosymbolic verification methods.

Nataša Kiš

Aidas Gudaitis

(1) Background: The article addresses the issue of geospatial dynamics of Lithuanian–Slavic ethnolinguistic boundaries in Southeastern Lithuania (SEL) that were influenced by long-term Lithuanian–Slavic linguistic competition. The aim of the study was to reconstruct the Lithuanian–Slavic ethnolinguistic boundaries and reveal the intensive contact zones in the late 19th century based on published data. Additionally, the study aimed to assess the geospatial changes in the ethnolinguistic situation in the research area during the period 1890–2021. (2) Methods: The ESRI ArcGIS technology geoprocessing tools were applied for boundary reconstruction and geospatial change detection. Cartographic materials, statistical data, and national census information were utilized in the process. (3) Results: The gained results provided a better understanding of Lithuanian–Slavic ethnolinguistic dynamics over space and time in the research area. The study reveals that the ethnolinguistic boundary in the Vilnius–Trakai urbanized area shifted in favor of the Lithuanian language, suggesting its potential influence on the metropolitan suburbs in the future. However, insufficient social infrastructure and weak economic development in rural settlements have led to a negative migration balance, a low birth rate, and rapid population aging. These challenges might have a negative effect on the future survival of the Lithuanian language in the multilingual rural area of SEL, especially considering the recent geopolitical realia in the region. (4) Conclusions: The study anticipates an increase in the influence of the Lithuanian language in the Vilnius–Trakai metropolitan area at the expense of further decline in the rural Lithuanian-speaking population in the next decade.

Nawoja Mikołajczak-Matyja

Functions of Pairs of Words from Sets of Non-Binary Semantic Oppositions in Sentences from the Texts of the National Corpus of Polish The article attempts to investigate whether pairs of words from sets of non-binary semantic oppositions perform the same functions in sentences as strong semantic binary oppositions. Six noun pairs were selected for analysis: summer/winter, arm/leg, cat/dog, coffee/tea, trousers/skirt and telephone/letter. A total of 1,200 sentences in which members of one of these six pairs co-occur were analysed; they were selected from the balanced sub-corpus of the National Corpus of Polish. A set of nine basic functions is presented, which has been applied in works on various languages in recent decades. The functions are identified by determining the mutual relationship between the members of the pair, based on the semantic-syntactic analysis of the immediate context and the meaning of the whole sentence. The present study confirms the usefulness of almost all the functions from the set for describing the way the analysed pairs are used in the sentences from the corpus. Apart from this, it was found that the same two functions are the strongest in the present study as in this type of analysis concerning strong binary oppositions. Funkcje par wyrazów ze zbiorów opozycji semantycznych wieloczłonowych w zdaniach z tekstów Narodowego Korpusu Języka Polskiego W artykule podjęto próbę sprawdzenia, czy pary wyrazów ze zbiorów opozycji semantycznych wieloczłonowych pełnią w zdaniach takie same funkcje, jak pary stanowiące silne opozycje semantyczne dwuczłonowe. Do analizy wybrano sześć par rzeczownikowych: lato/zima, ręka/noga, kot/pies, kawa/herbata, spodnie/spódnica i telefon/list. Ze zrównoważonego podkorpusu Narodowego Korpusu Języka Polskiego wyselekcjonowano 1200 zdań, w których współwystępują człony jednej z tych sześciu par. Przedstawiono zestaw dziewięciu podstawowych funkcji, wykorzystywany w ostatnich dziesięcioleciach w pracach dotyczących różnych języków. Funkcje wyodrębniane są poprzez określenie wzajemnej relacji między członami pary na podstawie analizy semantyczno-składniowej kontekstu bezpośredniego i ustalenia znaczenia całego zdania. Niniejsze badanie potwierdziło użyteczność prawie wszystkich funkcji z zestawu do opisu sposobu użycia badanych par w zdaniach z korpusu. Ponadto stwierdzono, że w obecnym badaniu najsilniejsze są te same dwie funkcje co w analizach tego typu dotyczących silnych opozycji binarnych.

Юрий Аркадьевич Борисёнок

Высокая степень изученности многих проблем, связанных с польским Январским восстанием 1863–1864 гг., сочетается в современной историографии с наличием дискуссионных аспектов темы, связанных с самоидентификацией повстанческой верхушки на литовско-белорусских землях. Особый интерес в этом плане вызывают особенности личности и мировоззрения Константина Калиновского (1838–1864), объявленного советской историографической традицией «белорусским революционным демократом». Монография российского историка А. Р. Дюкова, основанная на неизвестных ранее исследователям документах из архивов России, Польши и Литвы, представляет обновленную доказательную базу, позволяющую точнее оценить самосознание лидера и идеолога повстанцев и его связь с польской исторической, культурной и религиозной почвой. Автор анализирует и принципиально важную проблему, которую по идеологическим причинам избегали советские историки, – связь левого крыла повстанцев с польской аристократией, в том числе с князьями Чарторыйскими и влиятельной семьей Огинских. Помощь Калиновскому и связанным с ним повстанцам со стороны магнатской фамилии Огинских, владевшей информацией о личной жизни Александра II, тщательно утаивалась в Петербурге, в том числе и самим российским императором.  Рецензия поступила в редакцию 11.07.2024.  Цитирование Борисёнок Ю. А. Польское Январское восстание 1863–1864 гг. на литовско-белорусских землях: самосознание повстанческих верхов в свете новых архивных поисков // Славянский альманах. 2024. No 3–4. С. 482–499. DOI: 10.31168/2073-5731.2024.3-4.25

Yu. A. Tregubova, E. V. Lavrishcheva, A. S. Kisaryn

The article is devoted to the study of the sports slang features of figure skating fans in the modern Russian. The relevance of the study is due to the increased interest of domestic fans in figure skating, which was expressed in numerous author’s materials and comments on the Internet. The research was conducted on the material of the texts published on the Internet platform “Zen” for 2021—2022. The material includes 115 slang units. The main functions of modern sports slangisms in the sphere of “Figure skating” (nominative, expressiveevaluative, identifying, function of language economy) were studied. The main thematic groups of studied slangisms, represented by the names of sports competitions, programs and elements, figure skaters, athletes, coaches, ratings, fans / supporters, sports organizations are established. The main productive wordformation models of lexical elements of modern sports slang in the sphere of “Figure skating"” in Russian-language Internet communication are revealed. Conclusions are made that the most productive way of word formation of slangisms in the field of “Figure skating” are abbreviations of various types.

Caroline Bonhomme, Jean-Louis Dufour

A tactical military unit is a complex system composed of many agents such as infantry, robots, or drones. Given a mission, an automated planner can find an optimal plan. Therefore, the mission itself must be modeled. The problem is that languages like PDDL are too low-level to be usable by the end-user: an officer in the field. We present ORTAC+, a language and a planning tool designed for this end-user. Its main objective is to allow a natural modeling of the mission, to minimize the risk of bad modeling, and thus obtain reliable plans. The language offers high-level constructs specifically designed to describe tactical missions, but at the same time has clear semantics allowing a translation to PDDL, to take advantage of state-of-the-art planners.

Andy Yang, David Chiang, Dana Angluin

The expressive power of transformers over inputs of unbounded size can be studied through their ability to recognize classes of formal languages. In this paper, we establish exact characterizations of transformers with hard attention (in which all attention is focused on exactly one position) and attention masking (in which each position only attends to positions on one side). With strict masking (each position cannot attend to itself) and without position embeddings, these transformers are expressively equivalent to linear temporal logic (LTL), which defines exactly the star-free languages. A key technique is the use of Boolean RASP as a convenient intermediate language between transformers and LTL. We then take numerous results known for LTL and apply them to transformers, showing how position embeddings, strict masking, and depth all increase expressive power.

Bianca Truthe

Tree-controlled grammars are context-free grammars where the derivation process is controlled in such a way that every word on a level of the derivation tree must belong to a certain control language. We investigate the generative capacity of such tree-controlled grammars where the control languages are special regular sets, especially strictly locally testable languages or languages restricted by resources of the generation (number of non-terminal symbols or production rules) or acceptance (number of states). Furthermore, the set theoretic inclusion relations of these subregular language families themselves are studied.

Ryo Wakizaka, Atsushi Igarashi

Qubit allocation is a process to assign physical qubits to logical qubits in a quantum program. Since some quantum computers have connectivity constraints on applications of two-qubit operations, it is mainly concerned with finding an assignment and inserting instructions to satisfy the connectivity constraints. Many methods have been proposed for the qubit allocation problem for low-level quantum programs. This paper presents a type-based framework of qubit allocation for a quantum programming language with first-order functions. In our framework, the connectivity constraints are expressed by a simple graph of qubits called a coupling graph. We formalize (1) the source language, whose type system verifies that the number of qubits required for a given program to run does not exceed the number of nodes of the coupling graph, (2) the target language, whose qualified type system verifies that a well-typed program satisfies the connectivity constraints, and (3) an algorithm to translate a source program into a target program. We prove that both languages are type-safe and that the translation algorithm is type preserving.

Marta Šimečková

Hubert Haider, Luka Szucsich

Bartłomiej Czaplicki

Abstract:This paper applies the listener-oriented approach (Andersen 1973, 1978; Ohala 1981, 1992) to two diachronic changes in Kashubian: diphthongization and the contextual preservation and loss of the jers. It is shown that acoustic and perceptual factors provide a plausible explanation for the consecutive stages in the evolution of the two phenomena. The Kashubian changes illustrate two major types of the listener-oriented mechanism: changes resulting from hypocorrection and hypercorrection. It is shown that while both mechanisms rely on a phonological reanalysis of ambiguous phonetic properties, the outcome differs in each case: (i) a coarticulatory property is reanalyzed as phonological and (ii) a phonetic element is associated with a phonological source that is distinct from the source assumed by the speaker. While this discussion provides support for the non-deterministic nature of sound change, conditions that promote one type of change while inhibiting the other are identified. In hypocorrective changes, the prior existence of a certain structure in the language facilitates the emergence of this structure in other contexts. Hypercorrective changes, on the other hand, are predicted to occur when a feature with a long acoustic span is involved. Similar processes in other, mostly Slavic, languages are identified and compared with the Kashubian changes, with the aim of filling some gaps in the typology and providing a uniform explanation for these and similar mechanisms of change.

M. Kondratenko

This article examines the peculiarities of the designation of certain time periods in a number of Ukrainian dialects of the Carpathian region; in particular from the perspective of the specifics of dialect segmentation of this semantic sphere and of the principles of nomination. The lexical material of the Carpathian-Ukrainian dialects allows us to distinguish certain semantic models and shifts observed in time designations: the transfer of spatial parameters for the nomination of time and vice versa; the orientation in the names of months to phenological and economic cycles, and not to the division of the astronomical year into segments containing a certain number of days; the perception of the concept of “time” itself displayed by the vocabulary as a favourable or unfavourable time for any activity or life in general; the nomination of morning as the appearance of daylight or a period of time somewhat removed in the past from the moment of speech; and some borrowings are also noted as an integral part of the vocabulary denoting time in its various manifestations. On the basis of the analysis of material from Carpatho-Ukrainian dialect dictionaries, it is concluded that this vocabulary represents a number of semantic models of names of time periods that have parallels in other Slavic and some non-Slavic languages. Taking into account the linguistic and geographical aspect, namely, a fairly wide distribution in the language territory of Slavia, as well as beyond its borders, we can assume the status of these models as semantic archetypes represented collectively in the dialect zone of the Carpathians.

Albert Benveniste, Benoît Caillaud, Mathias Malandain

Modern modeling languages for general physical systems, such as Modelica, Amesim, or Simscape, rely on Differential Algebraic Equations (DAE), i.e., constraints of the form f(dot{x},x,u)=0. This drastically facilitates modeling from first principles of the physics and the reuse of models. In this paper we develop the mathematical theory needed to establish the development of compilers and tools for DAE based physical modeling languages on solid mathematical bases. Unlike Ordinary Differential Equations, DAE exhibit subtle issues because of the notion of differentiation index and related latent equations -- ODE are DAE of index zero for which no latent equation needs to be considered. Prior to generating execution code and calling solvers, the compilation of such languages requires a nontrivial \emph{structural analysis} step that reduces the differentiation index to a level acceptable by DAE solvers. The models supported by tools of the Modelica class involve multiple modes with mode-dependent DAE based dynamics and state-dependent mode switching. Multimode DAE are much more difficult than DAE. The main difficulty is the handling of the events of mode change. Unfortunately, the large literature devoted to the mathematical analysis of DAEs does not cover the multimode case, typically saying nothing about mode changes. This lack of foundations causes numerous difficulties to the existing modeling tools. Some models are well handled, others are not, with no clear boundary between the two classes. In this paper, we develop a comprehensive mathematical approach supporting compilation and code generation for this class of languages. Its core is the structural analysis of multimode DAE systems. As a byproduct of this structural analysis, we propose well sound criteria for accepting or rejecting models. For our mathematical development, we rely on nonstandard analysis, which allows us to cast hybrid systems dynamics to discrete time dynamics with infinitesimal step size, thus providing a uniform framework for handling both continuous dynamics and mode change events.

Rustam Tagiew

The target of this paper is to present an industry-ready prototype software for general game playing. This software can also be used as the central element for experimental economics research, interfacing of game-theoretic libraries, AI-driven software testing, algorithmic trade, human behavior mining and simulation of (strategic) interactions. The software is based on a domain-specific language for electronic business to business negotiations -- SIDL3.0. The paper also contains many examples to prove the power of this language.

Stefan Hoffmann

The class of known constraint automata for which the constrained synchronization problem is in NP all admit a special form. In this work, we take a closer look at them. We characterize a wider class of constraint automata that give constrained synchronization problems in NP, which encompasses all known problems in NP. We call these automata polycyclic automata. The corresponding language class of polycyclic languages is introduced. We show various characterizations and closure properties for this new language class. We then give a criterion for NP-completeness and a criterion for polynomial time solvability for polycyclic constraint languages.