Presentative deictics in Oromo

This study deals with the forms, meanings and functions of presentative deictics in Oromo. Basically, presentatives deictics are deictic expressions that are used in directing the attention of an addressee towards a referent mentioned by a speaker in the communication situation. They are expressed in the use of proximal and distal presentative deictic adverbs, adverbial phrases or determiners. This is a qualitative descriptive study and the data were collected through note-taking of free language use, elicitation, and introspection. The data thus collected were transcribed phonemically using IPA. The data were arranged in interlinear morpheme-by-morpheme basis in three lines following the Leipzig Glossing Rules. The results of the analyses contained lexicalizations of presentative expressions commonly used, (morpho)-syntactc properties of presentatives in different discourse contexts, the exophoric and referential functions of presentatives of which the exophoric function takes into account referents found in the environment where communication is taking place, and the referential functions were concerned with reference to linguistic items in the text. The offerative and the directive functions come under the exophoric use, whereas cataphoric, anaphoric and discourse signal functions come under referential functions. The meanings of the presentative deictics are based on the context in which they are used.

On the Balancedness of Tree-to-Word Transducers

A language over an alphabet [Formula: see text] of opening ([Formula: see text]) and closing ([Formula: see text]) brackets, is balanced if it is a subset of the Dyck language [Formula: see text] over [Formula: see text], and it is well-formed if all words are prefixes of words in [Formula: see text]. We show that well-formedness of a context-free language is decidable in polynomial time, and that the longest common reduced suffix can be computed in polynomial time. With this at a hand we decide for the class 2-TW of non-linear tree transducers with output alphabet [Formula: see text] whether or not the output language is balanced.

Eagle

Object sensitivity is widely used as a context abstraction for computing the points-to information context-sensitively for object-oriented programming languages such as Java. Due to the combinatorial explosion of contexts in large object-oriented programs, k -object-sensitive pointer analysis (under k -limiting), denoted k -obj , is often inefficient even when it is scalable for small values of k , where k ⩽ 2 holds typically. A recent popular approach for accelerating k -obj trades precision for efficiency by instructing k -obj to analyze only some methods in a program context-sensitively, determined heuristically by a pre-analysis. In this article, we investigate how to develop a fundamentally different approach, Eagle , for designing a pre-analysis that can make k -obj run significantly faster while maintaining its precision. The novelty of Eagle is to enable k -obj to analyze a method with partial context sensitivity (i.e., context-sensitively for only some of its selected variables/allocation sites) by solving a context-free-language (CFL) reachability problem based on a new CFL-reachability formulation of k -obj . By regularizing one CFL for specifying field accesses and using another CFL for specifying method calls, we have formulated Eagle as a fully context-sensitive taint analysis (without k -limiting) that is both effective (by selecting the variables/allocation sites to be analyzed by k -obj context-insensitively so as to reduce the number of context-sensitive facts inferred by k -obj in the program) and efficient (by running linearly in terms of the number of pointer assignment edges in the program). As Eagle represents the first precision-preserving pre-analysis, our evaluation focuses on demonstrating its significant performance benefits in accelerating k -obj for a set of popular Java benchmarks and applications, with call graph construction, may-fail-casting, and polymorphic call detection as three important client analyses.

Branching Densities of Cube-Free and Square-Free Words

Binary cube-free language and ternary square-free language are two “canonical” representatives of a wide class of languages defined by avoidance properties. Each of these two languages can be viewed as an infinite binary tree reflecting the prefix order of its elements. We study how “homogenious” these trees are, analysing the following parameter: the density of branching nodes along infinite paths. We present combinatorial results and an efficient search algorithm, which together allowed us to get the following numerical results for the cube-free language: the minimal density of branching points is between 3509/9120≈0.38476 and 13/29≈0.44828, and the maximal density is between 0.72 and 67/93≈0.72043. We also prove the lower bound 223/868≈0.25691 on the density of branching points in the tree of the ternary square-free language.

Listening to and Crafting Stories: Cultivating Activism in Online Doctoral Students

The Johns Hopkins online EdD program prepares students as scholar-practitioners who become leaders and agents of change across educational contexts. Advocating for equity and social justice requires our students to not only immerse themselves in the relevant literature and learn the traditional skills of applied research but to master the art of communication through a sort of storytelling. Storytelling, in this sense, represents a means to gather and analyze data and understand and integrate diverse perspectives to engage and persuade relevant stakeholders (Moezzi, Janda, & Rotmann, 2017). The Hopkins first-year EdD programming and coursework emphasize the use of deficit-free language to understand people and problems, consideration of diverse perspectives and structuring inquiry with a systems-approaches to explore contextual problems using a mixed methods research paradigms. Together, the program's approach to student learning and practice-oriented courses and dissertation research contribute to training scholar-practitioners as activists who ask relevant questions, draw on multiple perspectives to craft potential solutions, adapt to a variety of contexts and circumstances, engage with diverse stakeholders, reflect on their own assumptions, and admit to and learn from mistakes throughout the process. Through a detailed accounting and examination of the JHU onboarding features and processes, particular course content and assignments, as well as the interplay of these elements, this paper will demonstrate how attending to language, perspective taking, context, and research inquiry support the development of scholar-activists.

Generalizations of Code Languages with Marginal Errors

The [Formula: see text]-prefix-free, [Formula: see text]-suffix-free and [Formula: see text]-infix-free languages generalize the prefix-free, suffix-free and infix-free languages by allowing marginal errors. For example, a string [Formula: see text] in a [Formula: see text]-prefix-free language [Formula: see text] can be a prefix of up to [Formula: see text] different strings in [Formula: see text]. We also define finitely prefix-free languages in which a string [Formula: see text] can be a prefix of finitely many strings. We present efficient algorithms that determine whether or not a given regular language is [Formula: see text]-prefix-free, [Formula: see text]-suffix-free or [Formula: see text]-infix-free, and analyze the time complexity of the algorithms. We establish undecidability results for deciding these properties for (linear) context-free languages.

On the Commutative Equivalence of Algebraic Formal Series and Languages

The problem of the commutative equivalence of context-free and regular languages is studied. Conditions ensuring that a context-free language of exponential growth is commutatively equivalent with a regular language are investigated.

Ways of transforming the metaphysical thinkingin the “conceptless language” of the late M. Heidegger

The article provides an analysis of the concept of “conceptless language” in the works of the late Martin Heidegger. The formation of a “conceptless language” is one of the most mysterious phenomena in the philosophy of the thinker. The specific structure of this lan­guage is one of the main criticisms of the later works of the philosopher and the opposition of Heidegger as the author of “Sein und Zeit” to Heidegger of the period “Beiträge zur Philosophie. Vom Ereignis”. The article explains the specific structure of the “concept-free language”, the reasons for its creation and its role in the late Heidegger philosophy. An at­tempt is made to reveal the hidden logic of a “conceptless language” and the principles by which it is guided. The search for the logic of a “conceptless language” is carried out through consideration of some of its aspects: a way of expressing thoughts, features of the style of argumentation, and a method of forming terms. An analysis of these aspects shows how Heidegger seeks to overcome the problem of the so-called “refusal” (Versagen) of the language that arose after writing “Sein und Zeit”. In search of a language correspond­ing to the transition to a different beginning, the principles of the late Heidegger hermeneutic methodology are formed: the “principle of intentional incomprehensibility” of terms, “default logic”, clarification of terms through their “internal form”, method of “thoughtful use of language” (besinnliche Sprachgebrauch). The analysis leads to the con­clusion that the profound change in thinking, which the late Heidegger sought on the way to another beginning, is impossible without the transformation of the language. Due to the fact that the existing “metaphysical” thinking is directly related to the conceptual lan­guage, a “non-conceptual language” opens the way for alternative thinking.

On restarting automata with auxiliary symbols and small window size

Here we show that for monotone RWW- (and RRWW-) automata, window size two is sufficient, both in the nondeterministic as well as in the deterministic case. For the former case, this is done by proving that each context-free language is already accepted by a monotone RWW-automaton of window size two. In the deterministic case, we first prove that each deterministic pushdown automaton can be simulated by a deterministic monotone RWW-automaton of window size three, and then we present a construction that transforms a deterministic monotone RWW-automaton of window size three into an equivalent automaton of the same type that has window size two. Furthermore, we study the expressive power of shrinking RWW- and RRWW-automata the window size of which is just one or two. We show that for shrinking RRWW-automata that are nondeterministic, window size one suffices, while for nondeterministic shrinking RWW-automata, we already need window size two to accept all growing context-sensitive languages. In the deterministic case, shrinking RWW- and RRWW-automata of window size one accept only regular languages, while those of window size two characterize the Church-Rosser languages.