The class of Church-Rosser congruential languages has been introduced by McNaughton, Narendran, and Otto in 1988. A language L is Church-Rosser congruential (belongs to CRCL), if there is a finite, confluent, and length-reducing semi-Thue system S such that L is a finite union of congruence classes modulo S. To date, it is still open whether every regular language is in CRCL. In this paper, we ...

Shabir and Naz in [25] introduced the notion of soft topological spaces. They defined basic notions of soft topological spaces such as open soft sets, closed soft sets, soft subspaces, soft closure, soft nbd of a soft point, soft separation axioms, soft regular spaces, soft normal spaces and they established their several properties. Min in [19] investigated some properties of such soft separat...

This paper is the first of a two part series. In this paper, we first prove that the variety of dually quasi-De Morgan Stone semi-Heyting algebras of level 1 satisfies the strongly blended ∨-De Morgan law introduced in [20]. Then, using this result and the results of [20], we prove our main result which gives an explicit description of simple algebras(=subdirectly irreducibles) in the variety o...

We prove that if the group generated by an invertible and reversible Mealy automaton acts level-transitively on a regular rooted tree, then the semigroup generated by the dual automaton has exponential growth, hence giving a decision procedure of exponential growth for a restricted family of automaton (semi)groups. The purpose of this note is to link up two classes of groups and semigroups high...

The emergence of XML leads the development of applications centric XML-documents. Often the documents contain tagged paragraphs of natural language texts. The extraction of relevant data from paragraphs confronts with their irregular structure hidden in the text and requires powerful extraction patterns. Although a large spectrum of wrappers has been conceived to mainly process HTML pages, the ...

In this article we present a semi-supervised active learning algorithm for pattern discovery in information extraction from textual data. The patterns are reduced regular expressions composed of various characteristics of features useful in information extraction. Our major contribution is a semi-supervised learning algorithm that extracts information from a set of examples labeled as relevant ...

Although the age of acquisition of a language has an effect when learning a second language, the similarity between languages may also have a crucial role. The aim of the present study is to understand the influence of this latter factor in the acquisition of morphosyntactic information. With this purpose, two groups of highly proficient early Catalan-Spanish bilinguals were presented with a re...

We consider two elementary forms of string rewriting called guided insertion/deletion and guided rewriting. The original strings are modified depending on the match with a given set of auxiliary strings, called guides. Guided insertion/deletion considers matching of a string and a guide with respect to a specific correspondence of strings. Guided rewriting considers matching of a string and a g...

Description of the pairs 〈low approximation, upper approximation〉 of rough sets is an important aspect in the research of rough set theory by algebraic method. By defining some basic operators on the approximation pairs, rough algebras can be constructed. Then some general algebras can be selected to describe the pairs of rough sets. The most famous rough algebras are Rough Double Stone Algebra...

Let O K be a Dedekind domain with eld of fractions K. Let f : X ! Y be a nite morphism of projective, smooth, and geometrically connected curves over Spec(K). In this paper, we study some possible relationships between the models of X and of Y. In the rst part of the paper, we look at semi-stable and stable models, while in the second part we investigate regular models. Let us describe the cont...