Recursively Enumerable Languages Research Articles

Recognizable Languages of k-Forcing Automata

In this study, we show that automata theory is also a suitable tool for analyzing a more complex type of the k-forcing process. First, the definition of k-forcing automata is presented according to the definition of k-forcing for graphs. Moreover, we study and discuss the language of k-forcing automata for particular graphs. Also, for some graphs with different k-forcing sets, we study the languages of their k-forcing automata. In addition, for some given recognizable languages, we study the structure of graphs. After that, we show that k-forcing automata arising from isomorph graphs are also isomorph. Also, we present the style of words that can be recognized with k-forcing automata. Moreover, we introduce the structure of graphs the k-forcing automata arising from which recognize some particular languages. To clarify the notions and the results obtained in this study, some examples are submitted as well.

From words to pictures: Row-column combinations and Chomsky-Schützenberger theorem

The row-column combination RCC maps two (word) languages over the same alphabet onto the set of rectangular arrays, i.e., pictures, such that each row/column is a word of the first/second language. The resulting array is thus a crossword of the component words. Depending on the family of the components, different picture (2D) language families are obtained: e.g., the well-known tiling-system recognizable languages are the alphabetic projection of the crossword of local (regular) languages. We investigate the effect of the RCC operation especially when the components are context-free, also with application of an alphabetic projection. The resulting 2D families are compared with others defined in the past. The classical characterization of context-free languages, known as Chomsky-Schützenberger theorem, is extended to the crosswords in this way: the projection of a context-free crossword is equivalent to the projection of the intersection of a 2D Dyck language and the crossword of strictly locally testable language. The definition of 2D Dyck language relies on a new more flexible so-called Cartesian RCC operation on Dyck languages. The proof involves the version of the Chomsky-Schützenberger theorem that is non-erasing and uses a grammar-independent alphabet.

Siberian Animal Style as a Conceptual Basis for the Conversion of Traditional Artistic Heritage into Cultural Industries

The process of acquiring the author’s style, its semantic distinctive features, and the creation of the author’s identity is a fundamental problem for artists. The paper is devoted to the analysis of the artist’s native culture code influence on the creative concept and artistic language. Artistic inversion is important ‒ the inverse representation of the cultural code in the artist’s work. We consider artistic, pictorial inversion as a form of the artistic conceptualization. It contributes to the successful understanding of the connotations and intentions of the artist’s work by his audience. An analysis of Namdakov’s work allowed us to conceptualize the representation problem of the cultural code in Far East peoples’ contemporary art and describe artistic strategies that represent the influence of such semantic aspects of the cultural code as the influence of the artistic worldview, the strategies elevation of original interpretation and transformation of the animal style, the influence of the academic background. We define the artistic paradigm of the style as a style-forming factor in contemporary creative industries of artists who emerged from traditional crafts communities. The phenomenon of ethnic artistic tradition has been widely studied in the art history literature (T. M. Stepanskaya, A. V. Edokova, L. I. Nekhlyadovich). We believe, however, that attention should be focused on the content of “cultural code of artistic paradigm”, because ethnic artists consciously transform national artistic images and techniques through integration of their heritage into contemporary artistic language, culture and art background. This is particularly relevant for artists who institutionalize their style into a recognizable contemporary art language strategy. The main research question addressed in this paper is the representation peculiarities of the Namdakov’s artistic strategy semantic forms. He creates innovative ways of shaping, applies illogical, provocative and asymmetrical compositional solutions, creates fresh artistic metaphors, overcomes visual and figurative traditions and transforms ethnic artistic traditions into the leading artistic world-class trends of contemporary art. It has been proved that the animalistic style acquired a new modern dimension with the development of the creative industry in the regions of South-East Asia: the north of modern China and the art workshops of D. Namdakov and Zhigzhit Bayaskhalanov in the Russian Federation. It was the original interpretation of the animalistic style that became a powerful source for the development of traditional folk craft culture and brought the Far East peoples’ modern art to a new level of development, contributed to the evolution of the artist’s creative potential and gave many artists hope for creative expression.

Storybook Literacy Method Increasing Language Development in Children with Speech Delay

Children's speaking ability is very important in their development. Stages in a child's language development sometimes experience delays and can become a nuisance. The most common and easily recognizable language disorder is speech delay, which means the child's level of speech development is not appropriate for his age. One of the actions that can be taken for children who have speech delays is the storybook literacy method. This method can help develop and train children's language skills and through stories children are required to be active in developing language. The purpose of the study was to determine the effectiveness of the storybook literacy method on language development in children with speech delay. This study uses the One Group pre-test and post-test design. Sampling technique using non-probability sampling saturated sampling type. The sample is 10 children with mild speech delay. The research instrument was using the Stimulation of Early Intervention Detection of Growth and Development (SDIDTK) instrument through the KPSP form. The analysis used is the T-Test. The results of the T-Test test obtained a p-value of 0.000, which means that there is an influence of the storybook literacy method on children's language development with speech delay. Storybook literacy method is effective to improve language development in children with speech delay.

Rational, recognizable, and aperiodic partially lossy queue languages

Partially lossy queue monoids (plq monoids) model the behavior of queues that can non-deterministically forget specified parts of their content at any time. We call the subsets of this monoid partially lossy queue languages (plq languages). While many decision problems on recognizable plq languages are decidable, most of them are undecidable if the languages are rational. In particular, in this monoid the classes of rational and recognizable languages do not coincide. This is due to the fact that the class of recognizable plq languages is not closed under multiplication and iteration. However, we can generate the recognizable plq languages using special rational expressions consisting of the Boolean operations and restricted versions of multiplication and iteration. From these special rational expressions we can also obtain an MSO logic describing the recognizable plq languages. Moreover, we provide similar results for the class of aperiodic languages in the plq monoid.

Edoardo Tresoldi and the heteronomy of architecture

Edoardo Tresoldi and the heteronomy of architecture

Методологична рамка за извеждане на смислообразуващи категории в методиката на обучение по биология

Science could be thought as mature in cases it obtains clear terminology and methodology i.e. recognizable scientific language and object to be researched. The integrative sciences, such as the methodology of biology education, face the challenge to look for themselves “overshadow” of other sciences related to object or methodology. In search for defined territory among sciences, critically important is elucidating the categories and deducing fundamental concepts of a given science. Transfer of experience takes place in four-dimensional system – on first place, are ideas, on the second, are symbols, signs, and terms related with ideas; the third dimension is objective meaning, other words representation in reality (in culture as values – technological, ethical, aesthetical and so on) and the last dimension is methodological that marks interaction subject-object in research field. These four dimensions encompass the territory of scientific and educational sense and can be used as a methodological framework in developing fundamental categories of a specific science.

Parallel contextual array insertion deletion P systems and Siromoney matrix grammars

James et al. have introduced a variant of P systems called parallel contextual array insertion deletion P system and studied some of its properties. The family of array languages generated by this variant of PCAIDPS includes families of array languages like recognisable picture languages (REC) and context-sensitive matrix languages . In this paper we show that another interesting family of Siromoney matrix languages is included in the family of array languages generated by PCAIDPS with two membranes.

Time Varying Splicing Recognizers

In this work, we construct splicing recognizers of radius 2 capable of accepting recursively enumerable languages. Cavaliere, Jonoska and Leupold introduced the concept of splicing recognizers in 2006 and constructed splicing recognizers of radius 4 which can accept recursively enumerable languages. It was conjectured that the radius of splicing recognizers, accepting recursively enumerable languages can be decreased. We prove in this paper that the conjecture is true and in fact, radius 2 is sufficient. We also introduce the concept of time varying splicing recognizers and show that these recognizers of radius 1 are capable of accepting recursively enumerable languages.

Weak Separation Problem for Tree Languages

Forest algebras are defined for investigating languages of forests [ordered sequences] of unranked trees, where a node may have more than two [ordered] successors. They consist of two monoids, the horizontal and the vertical, with an action of the vertical monoid on the horizontal monoid, and a complementary axiom of faithfulness. A pseudovariety is a class of finite algebras of a given signature, closed under the taking of homomorphic images, subalgebras and finitary direct products. By looking at the syntactic congruence for monoids and as the natural extension in the case of forest algebras, we could define a version of syntactic congruence of a subset of the free forest algebra, not just a forest language. Let [Formula: see text] be a finite alphabet and [Formula: see text] be a pseudovariety of finite forest algebras. A language [Formula: see text] is [Formula: see text]-recognizable if its syntactic forest algebra belongs to [Formula: see text]. Separation is a classical problem in mathematics and computer science. It asks whether, given two sets belonging to some class, it is possible to separate them by another set of a smaller class. Suppose that a forest language [Formula: see text] and a forest [Formula: see text] are given. We want to find if there exists any proof for that [Formula: see text] does not belong to [Formula: see text] just by using [Formula: see text]-recognizable languages, i.e. given such [Formula: see text] and [Formula: see text], if there exists a [Formula: see text]-recognizable language [Formula: see text] which contains [Formula: see text] and does not contain [Formula: see text]. In this paper, we present how one can use profinite forest algebra to separate a forest language and a forest term and also to separate two forest languages.

Review of What Can Be Computed

What can be Computed is a textbook for a course that covers Decidable Languages, Computable Functions, Recursively Enumerable Languages, Turing Machines, Reductions, Regular Languages, P, NP, and NPcompleteness. Since there are already many books with these topics in them, the question is:

Modalities of translating nonsense

ABSTRACTThe essay deals with the paradox of translating nonsense texts: how can one translate a text that is devoid of meaning? And yet, surely, text being written in a recognizable natural language (there is such a thing as English nonsense) can be translated. The essay considers a proto-lettrist poem by Morgenstern, a nonsense letter by Edward Lear, and a series of translations of the first stanza of Lewis Carroll’s poem “Jabberwocky”: first Carroll’s own youthful translation into “literal English”, then a number of French translations, culminating in the “perfect” translation by Henri Parisot and Artaud’s famous non-translation in his “anti-grammatical attempt against Lewis Carroll”. The translations are analyzed using various combinations of grammatical modalities and negation (“you cannot translate nonsense and yet you must”, etc.). Their sequence forms a gradient that goes from non-translation (Morgenstern’s poem cannot be translated insofar as it is always-already translated) to Artaud’s non-translation, which might be more properly called an “un-translation”.

Intuitionistic fuzzy recursive enumerable languages and its closure properties

Intuitionistic fuzzy recursive enumerable languages and its closure properties

KAZUO ISHIGURO. THE WRITER IN THE ‘FLOATING WORLD’

Novels by the Nobel Prize winner in literature 2017 K. Ishiguro are analyzed chronologically, from the first novel A Pale View of Hills (1982) to the latest one The Buried Giant (2015). As the article shows, the author, who represents two cultural traditions, the Japanese and the British ones, reflects this quality in his works. The writer himself states that his works were mainly formed by the European literary tradition and, consequently, his novel The Remains of the Day has become a concentrated study of Englishness, one of the most vivid in contemporary British literature. Experimenting with traditional literary forms, Ishiguro uses the stream-of-conscience technique, elements of science fiction, fantasy, detective genres, but each of his novels is unique and is characterized by deep overtones. Some constant elements of the writer’s works are discussed: unreliable narrators, the opposition of memory and history, the special role of children and of old people in his novels, the significant role of periods before and after historic events that are omitted in his novels, and recognizable language and style – compact, reserved and precise.

Recognizable languages of arrows and cospans

In this article, we generalize Courcelle's recognizable graph languages and results on monadic second-order logic to more general structures.First, we give a category-theoretical characterization of recognizability. A recognizable subset of arrows in a category is defined via a functor into the category of relations on finite sets. This can be seen as a straightforward generalization of finite automata. We show that our notion corresponds to recognizable graph languages if we apply the theory to the category of cospans of graphs.In the second part of the paper, we introduce a simple logic that allows to quantify over the subobjects of a categorical object. Again, we show that, for the category of graphs, this logic is equally expressive as monadic second-order graph logic (msogl). Furthermore, we show that in the more general setting of hereditary pushout categories, a class of categories closely related to adhesive categories, we can recover Courcelle's result that everymsogl-expressible property is recognizable. This is done by giving an inductive translation of formulas of our logic into automaton functors.

The Use Of Voice in Opac Using Google API Voice Recognition & Speech Synthesis and Fullproof Algorithm as Faster Searching Device

The development of technology provides convenience to all human beings including public librarians. OPAC becomes a solution for library users to search books in a short time with accurate data in which they previously used a manual system. However, there are some users, especially users with certain disabilities, such as users who cannot see, are unable to use OPAC. The idea came up to make OPAC with voice as a substitute for another alternative of text input use. OPAC with voice has been used in several big libraries in Indonesia. One of them is in State Islamic University of Sunan Kalijogo. However, because there are still some shortcomings in terms of voice recognition in which one of them is the limited number of recognizable languages, so in this study, it will be discussed the use of Google API for voice recognition and voice synthesis which is then integrated with OPAC, and the algorithm used in the search is Fullproof algorithm. The methods used in this research were literature study, system design, prototype application creation, and application testing. From the test results, the application is able to search the data book in OPAC using voice input from various languages with a relatively fast searching time. Applications are also able to voice the book found in the form of sound.

A mobile app for teaching formal languages and automata

AbstractFormal Languages and Automata (FLA) address mathematical models able to specify and recognize languages, their properties and characteristics. Although solid knowledge of FLA is extremely important for a B.Sc. degree in Computer Science and similar fields, the algorithms and techniques covered in the course are complex and difficult to assimilate. Therefore, this article presents FLApp, a mobile application—which we consider the new way to reach students—for teaching FLA. The application—developed for mobile phones and tablets running Android—provides students not only with answers to problems involving Regular, Context‐free, Context‐Sensitive, and Recursively Enumerable Languages, but also an Educational environment that describes and illustrates each step of the algorithms to support students in the learning process.

English

English

What Yun Ch'i-ho Knew: U.S.-Japan Relations and Imperial Race Making in Korea and the American South, 1904–1919

On March 1, 1919, thousands of Koreans staged a public demonstration in Seoul to draw the attention of Woodrow Wilson. During the previous year, while World War I was still in progress, the American president had openly declared that all people in the aftermath of the war should be “dominated and governed only by their own consent,” by the principle of “self-determination.” When Wilson had appeared in January 1919 at the Paris Peace Conference to reconfigure the postwar world, the demonstrating Koreans, who had been living as colonial subjects of the Japanese Empire for many years, attempted to seize the opportunity and articulate their anticolonial aspirations in the same recognizable language. They championed the principle of self-determination aloud, hoping that Wilson would deliver them from Japanese rule.1 A fifty-four-year-old Korean named Yun Ch'i-ho warned that Wilson would not do so. Wilson's intended audience, he explained, were “those affected by the Great War, and Korea and other nations unaffected by the war [did] not have a reason to self-determine.” Even if the case of Korea received attention in Paris, Yun contended in an interview with the colonial government's official Japanese-language organ, Keijō Nippō, and its official Korean-language organ, Maeil Sinbo, the United States would not go to war against Japan for Korean independence. Given the seeming impossibility of an American intervention, Yun lamented that the Korean demonstration would only arouse Japan's anger toward the “weak race” instead of winning its “good will,” and would eventually bring harm to the Korean people.2

On the computational completeness of graph-controlled insertion–deletion systems with binary sizes

A graph-controlled insertion–deletion (GCID) system is a regulated extension of an insertion–deletion system. Such a system has several components and each component has some insertion–deletion rules. The transition is performed by any applicable rule in the current component on a string and the resultant string is then moved to the target component specified in the rule. The language of the system is the set of all terminal strings collected in the final component. The parameters in the size (k;n,i′,i″;m,j′,j″) of a GCID system denote (from left to right) the maximum number of components, the maximal length of the insertion string, the maximal length of the left context for insertion, the maximal length of the right context for insertion; the last three parameters follow a similar representation with respect to deletion.In this paper, we discuss the computational completeness of the families of GCID systems of size (k;1,i′,i″;1,j′,j″) with k∈{3,5} and for (nearly) all values of i′,i″j′,j″∈{0,1}. All proofs are based on the simulation of type-0 grammars given in Special Geffert Normal Form (SGNF). The novelty in our proof presentation is that the context-free and the non-context-free rules of the given SGNF grammar are simulated by GCID systems of different sizes and finally we combine them by stitching and overlaying to characterize the recursive enumerable languages. This proof presentation greatly simplifies and unifies the proof of such characterization results. We also connect some of the obtained GCID simulations to the domain of insertion–deletion P systems.