Hasil untuk "Oriental languages and literatures"

Orazio Maria Gnerre

Since it is no longer part of the Soviet Union, Armenia has found itself in the position of being able to choose its partners independently. This was largely determined by proximity relations, by historical ones with Russia, and by the places where the emigration of Armenia’s own people took place. Beyond that, it is placed in conditions of choice between cooperation with some actors rather than others. In this sense, Armenia has started dialogue and trade relations with two Asian giants, China and India. The article proposes to recap the relations between these countries, paying attention to the factors that could allow a triangular cooperation rather than a competition.

Benedek Nagy

Linear automata are automata with two reading heads starting from the two extremes of the input, are equivalent to 5' -> 3' Watson-Crick (WK) finite automata. The heads read the input in opposite directions and the computation finishes when the heads meet. These automata accept the class LIN of linear languages. The deterministic counterpart of these models, on the one hand, is less expressive, as only a proper subset of LIN, the class 2detLIN is accepted; and on the other hand, they are also equivalent in the sense of the class of the accepted languages. Now, based on these automata models, we characterize the class of 2detLIN languages with a Myhill-Nerode type of equivalence classes. However, as these automata may do the computation of both the prefix and the suffix of the input, we use prefix-suffix pairs in our classes. Additionally, it is proven that finitely many classes in the characterization match with the 2detLIN languages, but we have some constraints on the used prefix-suffix pairs, i.e., the characterization should have the property to be complete and it must not have any crossing pairs.

Jan Baumeister, Arthur Correnson, Bernd Finkbeiner et al.

Stream-based runtime monitors are safety assurance tools that check at runtime whether the system's behavior satisfies a formal specification. Specifications consist of stream equations, which relate input streams, containing sensor readings and other incoming information, to output streams, representing filtered and aggregated data. This paper presents a framework for the stream-based specification language RTLola. We introduce a new intermediate representation for stream-based languages, the StreamIR, which, like the specification language, operates on streams of unbounded length; while the stream equations are replaced by imperative programs. We developed a set of optimizations based on static analysis of the specification and have implemented an interpreter and a compiler for several target languages. In our evaluation, we measure the performance of several real-world case studies. The results show that using the StreamIR framework reduces the runtime significantly compared to the existing StreamIR interpreter. We evaluate the effect of the optimizations and show that significant performance gains are possible beyond the optimizations of the target language's compiler. While our current implementation is limited to RTLola, the StreamIR is designed to accommodate other stream-based languages, enabling their interpretation and compilation into all available target languages.

Siti Humaira, Muhammad Ridha, Abdullah Abdullah et al.

Based on the first observation at MTsN 2 Aceh Besar the researcher found that student are difficulty in learning Arabic lessons, especially in speaking skills, they cannot use words in speaking, and also they are afraid of making mistakes when speaking arabic. Because the teacher only uses one learning method, is discovery learning, and the teacher does not used the right media in learning process.To overcome this problem, researcher want yo use of picture card media to improve speaking skills students.The purpose of this study was to determine the effectiveness of using picture card media to improve speaking skills students and to find out the activities of teacher and students during the learning process of using picture card media. In this study, researcher used experimental research with the design of One Group Pre-Test Post-Test Design. For data collection, researcher use pre-test and post-test, and researcher also use direct observation. The result of this study incate that the result of pre-test and post-test are with a significiance level (Asymp.Sig. 2-tailed) 0,000 < 0,05. This proves that use of the picture card media is effective to improve speaking skills students. And as for the result of observations of teacher and student activities use of the picture card media, the result obtained very good scores which result reached 87,5%.

Oscar H. Ibarra, Ian McQuillan

There are many types of automata and grammar models that have been studied in the literature, and for these models, it is common to determine whether certain problems are decidable. One problem that has been difficult to answer throughout the history of automata and formal language theory is to decide whether a given system $M$ accepts a bounded language (whether there exist words $w_1, \ldots,w_k$ such that $L(M) \subseteq w_1 \cdots w_k$?). Decidability of this problem has gone unanswered for the majority of automata/grammar models in the literature. Boundedness was only known to be decidable for regular and context-free languages until recently when it was shown to also be decidable for finite-automata and pushdown automata augmented with reversal-bounded counters, and for vector addition systems with states. In this paper, we develop new techniques to show that the boundedness problem is decidable for larger classes of one-way nondeterministic automata and grammar models, by reducing the problem to the decidability of boundedness for simpler classes of automata. One technique involves characterizing the models in terms of multi-tape automata. We give new characterizations of finite-turn Turing machines, finite-turn Turing machines augmented with various storage structures (like a pushdown, multiple reversal-bounded counters, partially-blind counters, etc.), and simple matrix grammars. The characterizations are then used to show that the boundedness problem for these models is decidable. Another technique uses the concept of the store language of an automaton. This is used to show that the boundedness problem is decidable for pushdown automata that can "flip" their pushdown a bounded number of times, and boundedness remains decidable even if we augment this device with additional stores.

Taisei Nogami, Tachio Terauchi

Backreference is a well-known practical extension of regular expressions and most modern programming languages, such as Java, Python, JavaScript and more, support regular expressions with backreferences (rewb) in their standard libraries for string processing. A difficulty of backreference is non-regularity: unlike some other extensions, backreference strictly enhances the expressive power of regular expressions and thus rewbs can describe non-regular (in fact, even non-context-free) languages. In this paper, we investigate the expressive power of rewbs by comparing rewbs to multiple context-free languages (MCFL) and parallel multiple context-free languages (PMCFL). First, we prove that the language class of rewbs is a proper subclass of unary-PMCFLs. The class of unary-PMCFLs coincides with that of EDT0L languages, and our result strictly improves the known upper bound of rewbs. Additionally, we show that, however, the language class of rewbs is not contained in that of MCFLs even when restricted to rewbs with only one capturing group and no captured references. Therefore, in general, the parallelism seems essential for rewbs. Backed by these results, we define a novel syntactic condition on rewbs that we call closed-star and observe that it provides an upper bound on the number of times a rewb references the same captured string. The closed-star condition allows dispensing with the parallelism: that is, we prove that the language class of closed-star rewbs falls inside the class of unary-MCFLs, which is equivalent to that of EDT0L systems of finite index. Furthermore, as additional evidence for the robustness of the condition, we show that the language class of closed-star rewbs also falls inside the class of nonerasing stack languages (NESL).

Abdelrahman Abounegm, Nikolai Kudasov, Alexey Stepanov

We report on a half-semester course focused around implementation of type systems in programming languages. The course assumes basics of classical compiler construction, in particular, the abstract syntax representation, the Visitor pattern, and parsing. The course is built around a language Stella with a minimalistic core and a set of small extensions, covering algebraic data types, references, exceptions, exhaustive pattern matching, subtyping, recursive types, universal polymorphism, and type reconstruction. Optionally, an implementation of an interpreter and a compiler is offered to the students. To facilitate fast development and variety of implementation languages we rely on the BNF Converter tool and provide templates for the students in multiple languages. Finally, we report some results of teaching based on students' achievements.

إدريس بن حسن بن أحمد القوزي

يهدف البحث إلى تناول القراءات التي أوردها الفوزان في شرحه لألفية ابن مالك، وعرض توجيهاته النحوية والدلالية لها ومناقشتها؛ لأجل إظهار الإعجاز اللغويّ والنّحوي لها وتوصيف منهجه في التّعامل النّحويّ معها، واحتوى مقدمة وثلاثة عشر مطلباً تطرقت إلى التوجيه النحوي في أبواب: النكرة والمعرفة، والمبتدأ والخبر، وكان وأخواتها، وإن وأخواتها، ونائب الفاعل، واشتغال العامل عن المعمول، والاستثناء، والإضافة، واسم الفاعل، والتوابع، والممنوع من الصرف، وإعراب الفعل، وتمّ التّوصل إلى نتائج أهمّها أنّ الفوزان وقف في توجيه القراءات موقف المُسَلِّم لها المُحتَجّ بها، إلّا أنّه في مواطن قليلة فضّل بعضها ورجّح بعضها على بعض في التّوجيه النّحوي من غير ردّ ولا تلحين.

Pyotr A. Avakov, Bembya L. Mitruev

Introduction. Sphragistic sources play an important role in the historical study of the Kalmyk Khanate. Seals of the Kalmyk nobility gain particular importance for further insights into the shaping of the institution of khanship, genesis of Kalmyk nationhood, and religious-political ties between the Khanate and Tibet. Goals. The article introduces into scientific circulation a previously unknown seal of the Kalmyk Taishi (future Khan) Ayuka put by him in early 1684 on a shert manuscript. Materials and methods. The original document has been discovered at the Russian State Archive of Ancient Acts. It rarely attracted the attention of historians who preferred to use its outdated publication of 1830. The study employs a set of research methods inherent to historical science, philology, and linguistics. Results. The paper investigates the circumstances that witnessed Ayuka’s use of the seal when the Kalmyk nobility were taking an oath of allegiance to the Russian Tsar, analyzes its appearances and Sanskrit-language legend. As compared to similar ceremonies in 1673 and 1677, the fact that Ayuka certified his oath with a seal in 1684 was a novelty in the oath taking procedure. Conclusions. The work suggests this seal be the earliest one of Ayuka’s personal seals known to date. The presence of the Indian title ‘rāja’ in the seal’s legend makes it possible to presume that even then Ayuka tended to position himself as supreme ruler of all Kalmyks in the status of Khan, although he received this title from the Dalai Lama over the subsequent years.

Zhendong Ang, Umang Mathur

In this paper, we focus on the problem of dynamically analysing concurrent software against high-level temporal specifications. Existing techniques for runtime monitoring against such specifications are primarily designed for sequential software and remain inadequate in the presence of concurrency -- violations may be observed only in intricate thread interleavings, requiring many re-runs of the underlying software. Towards this, we study the problem of predictive runtime monitoring, inspired by the analogous problem of predictive data race detection studied extensively recently. The predictive runtime monitoring question asks, given an execution $σ$, if it can be soundly reordered to expose violations of a specification. In this paper, we focus on specifications that are given in regular languages. Our notion of reorderings is trace equivalence, where an execution is considered a reordering of another if it can be obtained from the latter by successively commuting adjacent independent actions. We first show that the problem of predictive admits a super-linear lower bound of $O(n^α)$, where $n$ is the number of events in the execution, and $α$ is a parameter describing the degree of commutativity. As a result, predictive runtime monitoring even in this setting is unlikely to be efficiently solvable. Towards this, we identify a sub-class of regular languages, called pattern languages (and their extension generalized pattern languages). Pattern languages can naturally express specific ordering of some number of (labelled) events, and have been inspired by popular empirical hypotheses, the `small bug depth' hypothesis. More importantly, we show that for pattern (and generalized pattern) languages, the predictive monitoring problem can be solved using a constant-space streaming linear-time algorithm.

Jessie Galasso-Carbonnel, Chico Sundermann

This is the proceedings of the Sixth International Workshop on Languages for Modelling Variability (MODEVAR 2024) which was held at Bern, Switzerland, February 06th 2024.

Laura Ciobanu, Alex Levine

The survey provides an overview of the work done in the last 10 years to characterise solutions to equations in groups in terms of formal languages. We begin with the work of Ciobanu, Diekert and Elder, who showed that solutions to systems of equations in free groups in terms of reduced words are expressible as EDT0L languages. We provide a sketch of their algorithm, and describe how the free group results extend to hyperbolic groups. The characterisation of solutions as EDT0L languages is very robust, and many group constructions preserve this, as shown by Levine. The most recent progress in the area has been made for groups without negative curvature, such as virtually abelian, the integral Heisenberg group, or the soluble Baumslag-Solitar groups, where the approaches to describing the solutions are different from the negative curvature groups. In virtually abelian groups the solutions sets are in fact rational, and one can obtain them as $m$-regular sets. In the Heisenberg group producing the solutions to a single equation reduces to understanding the solutions to quadratic Diophantine equations and uses number theoretic techniques. In the Baumslag-Solitar groups the methods are combinatorial, and focus on the interplay of normal forms to solve particular classes of equations. In conclusion, EDT0L languages give an effective and simple combinatorial characterisation of sets of seemingly high complexity in many important classes of groups.

Arthur Matevosyan

It is well known that the Christology of the Armenian Church is based on the Christological teaching of St. Cyril of Alexandria. Following St. Cyril, the Armenian Church confirms the invariability and perfection of divine and human natures in Christ. The hypostatic union of Christ does not lead to a change or amalgamation of natures. It admits the union of Christ with God the Father in deity and with us in humanity. Jesus Christ, the only begotten Son of God, is a perfect God and a perfect man, begotten before the ages from the Father according to deity, and for our salvation from Mary the Virgin according to humanity. And therefore, there is one nature of God the Word incarnate, revered together with His flesh in one worship. This is what the Armenian Church has believed since the 5th century to date. This article will examine the connection of 12 anathematisms contained in the letter of St. Cyril of Alexandria to Nestorius with the Christological teaching of the Armenian Church.

Bertrand Meyer

A description of language design choices that have profound effects on software quality, criticism of how ordinary OO languages address them, and explanation of the thinking behind Eiffel's corresponding mechanisms.

Frank F. Xu, Uri Alon, Graham Neubig et al.

Large language models (LMs) of code have recently shown tremendous promise in completing code and synthesizing code from natural language descriptions. However, the current state-of-the-art code LMs (e.g., Codex (Chen et al., 2021)) are not publicly available, leaving many questions about their model and data design decisions. We aim to fill in some of these blanks through a systematic evaluation of the largest existing models: Codex, GPT-J, GPT-Neo, GPT-NeoX-20B, and CodeParrot, across various programming languages. Although Codex itself is not open-source, we find that existing open-source models do achieve close results in some programming languages, although targeted mainly for natural language modeling. We further identify an important missing piece in the form of a large open-source model trained exclusively on a multi-lingual corpus of code. We release a new model, PolyCoder, with 2.7B parameters based on the GPT-2 architecture, which was trained on 249GB of code across 12 programming languages on a single machine. In the C programming language, PolyCoder outperforms all models including Codex. Our trained models are open-source and publicly available at https://github.com/VHellendoorn/Code-LMs, which enables future research and application in this area.

Mhamed Rebba

The study of the causes of the Qur’anic endowment in the Book of God Almighty is a topic of great importance and ignorance of which cannot be tolerated at all, and for this reason the ancient linguists and scholars of the Qur’anic sciences took care of it and used it in their syntheses and consulted with it a lot. It is the result of being influenced by a number of different sciences. Hence this paper came to shed light on the reasons calling for the differences of endowment scholars as well as the commentators about determining the places of endowment and beginning in the verses of the Noble Qur’an, and that their endowments and beginnings were based on a set of rules: explanatory, grammatical, reading, and jurisprudence. The importance of stopping and starting in understanding the meanings of the Qur’an correctly. The search for the reasons that motivate the different aspects of endowment and initiation: in terms of grammar, jurisprudence, and doctrine. My interest in the interpretation of Al-Qurtubi: "The Collector of the Laws of the Qur'an", as I found it a useful book and an original source in a number of sciences. As for the method used in dealing with the subject of the research, it is the inductive-analytical method. One of the advantages of my research, as I see it, is that I have never had a similar study in revealing the reasons for standing and beginnings through the interpretation of al-Qurtubi, and my study was unique in linking the reasons for disagreement with Quranic models of the interpretation referred to previously. In addition to the need for the reader and the exegete to pay attention to understanding the science of endowment and the beginning, its causes, and its aspects... so that he can differentiate between the different meanings and the two different rulings.

Şirin Gökkaya

Osmanlı Devletinin yaklaşık dört yüzyıl hâkimiyetini devam ettirdiği Filistin’den 19. yüzyılda çekilmek durumunda kalması, bölgede coğrafi ve siyasi açıdan büyük değişiklikler olmasına neden olur. Filistin’in gerek stratejik konumu gerekse üç ilahi din olan İslamiyet, Hıristiyanlık ve Yahudilik açısından kutsal sayılan mekânlara ev sahipliği yapması bölgeyi öteden beri farklı güç odaklarının hâkimiyet kurma istekleriyle karşı karşıya bırakır. 1948 yılında işgal edilen Filistin topraklarında İsrail Devletinin kurulması üzerine Birinci Arap-İsrail Savaşı resmen başlar. Bu savaşta İsrail, Filistin topraklarının hemen hemen dörtte üçünü ele geçirdiği gibi Kudüs’ün de yarısını ele geçirir. Ürdün ise eski şehri yani Doğu Kudüs’ü ele geçirir. Böylece Kudüs Batı ve Doğu olmak üzere ikiye bölünür. İsrail, Doğu Kudüs ve Batı Kudüs arasına Mendelbum adında bir sınır kapısı, bir geçiş kontrol kapısı koyar. Mendelbum Kapısı, İsrail’de kalan Filistinliler ile Batı Şeria olarak adlandırılan ve o dönem Ürdün yönetimi altında kalan bölgede bulunan veya başka ülkelerde bulunan Filistinlilerin birinci dereceden akrabalarıyla görüşebilecekleri bir nokta olur. Mendelbum Kapısı, bir sınır kontrol kapısı olmasından öte kullanıldığı yıllar boyunca hem kavuşmanın hem de ayrılığın simgesine dönüşür. Zira, İsrail Devleti’nin kuruluşuyla Filistin halkının göçe zorlanması, mülteci olarak yaşamak zorunda bırakılması ailelerin parçalanmasına, bireylerin oradan oraya savrulmasına neden olur. Dağılan ailelerin, bazen yılda bir defa verilen izinle kısa süreli kavuşmaları bazen de yıllar boyunca vize başvurularının reddedilmesiyle birbirlerinden habersizce yaşamak zorunda bırakılmaları gibi dramlar yaşanır, işte bu yaşanmışlıklar da Filistin kısa hikâyesinde yerini bulur. Bu makalede Filistin edebiyatında önemli bir yere sahip yazarlardan Semîra ‘Azzâm, Ġassân Kenefânî ve Necva Ḳa’vâr Faraḥ’a ait ve Mendelbum Kapısında yaşanan kavuşmalar ekseninde dönen ‘Âmun Âḫir (Başka Bir Yıl), el-Ufuḳ Varâʹe’l-bavvâbe (Ufkun Ardındaki Kapı) ve Bavvâbat Mendelbûm (Mendelbum Kapısı) adlı hikâyeler incelenecektir.

Mahmut Üstün

Arap edebiyatında birçok farklı şiir türü bulunmaktadır. Bunlardan birisi de Hz. Peygamber’in methini konu edinen ve her beytinde en az bir tane bedî‘ sanat bulunduran bedî‘iyyât şiirleridir. Bedî‘iyyâtların konusu, bedî‘ sanatları kullanarak Hz. Peygamberi övmek olduğu için hem medih hem de ta‘lîmî/didaktik temalı şiirlerdir. Her ne kadar bu tür şiirlerin mucidi hususunda çeşitli rivayetler bulunsa da kabul edilen görüş Safiyyüddin el-Hillî olduğu yönündedir. Fakat el-Hillî’nin bu türü sistematize ettiği ve şiirde yeni bil yol açtığı hususunda şüphe yoktur. Arap edebiyatında İnhitât dönemi (1258-1798) olarak adlandırılan süre içerisinde ilk örnekleri verilen bedî‘iyyât şiirlerinin yıldızı, Memlükler döneminde parlamıştır. Toplumun beklentisi karşısında belâgata karşı olan ilginin artması, Peygamber konulu methiyelerin fazlalaşması, şairlerin kendi aralarındaki rekabet ve meşhur olma isteği, tevessül vesilesi olarak görülmeleri ve hastalıkları iyileştirmesi gibi etkenlerin bedî‘iyyât şiirlerinin revaçta olmasına ve fazlaca nazmedilmesine sebep olduğu söylenebilir. Bu çalışmada da bedî‘iyyât şiirleri hakkında genel bir sunum yapıldıktan sonra bu türün iki önemli ismi olan Safiyyüddin el-Hillî ve İbn Câbir el-Endelüsî hakkında kısa bilgiler verilmiş ve bedî‘iyyelerinin bazı bölümlerinin çevirisi yapılarak içerisinde kullanılan bedî‘ sanatlar gösterilmiştir. Beyitlerin seçiminde bedî‘iyyâtlarda ele alınan konu çeşitliliği adına her konudan en az bir örnek verilmiştir. Şairlerin bedî‘ sanatları nasıl kullandıklarını göstermek için ise bazıları aynı olanlardan, bazıları ise farklı olanlardan seçilmiştir.

Lorenzo Clemente, Michał Skrzypczak

We show that it is decidable whether two regular languages of infinite trees are separable by a deterministic language, resp., a game language. We consider two variants of separability, depending on whether the set of priorities of the separator is fixed, or not. In each case, we show that separability can be decided in EXPTIME, and that separating automata of exponential size suffice. We obtain our results by reducing to infinite duration games with ω-regular winning conditions and applying the finite-memory determinacy theorem of Büchi and Landweber.