The partial derivative automaton (Apd) is usually smaller than other nondeterministic finite automata constructed from a regular expression, and it can be seen as a quotient of the Glushkov automaton (Apos). By estimating the number of regular expressions that have ε as a partial derivative, we compute a lower bound of the average number of mergings of states in Apos and describe its asymptotic...

This paper focuses on the issue of how generalizations of continuous and leftcontinuous t-norms over linearly ordered sets should be from a logical point of view. Taking into account recent results in the scope of algebraic semantics for fuzzy logics over chains with a monoidal residuated operation, we advocate linearly ordered BL-algebras and MTL-algebras as adequate generalizations of continu...

We relate two measures of complexity of regular languages. The first is syntactic complexity, that is, the cardinality of the syntactic semigroup of the language. That semigroup is isomorphic to the semigroup of transformations of states induced by non-empty words in the minimal deterministic finite automaton accepting the language. If the language has n left quotients (its minimal automaton ha...

9 Let X be a tree and letG=Aut(X), Bass and Tits have given an algorithm to construct the ‘ultimate quotient’ of X by G starting with any quotient of X, an ‘edge-indexed’ graph. Using a sequence of 11 integers that we compute at consecutive steps of the Bass–Tits (BT) algorithm, we give a lower bound on the diameter of the ultimate quotient of a tree by its automorphism group. For a tree X with...

In this paper, we introduce the concept of fuzzy congruences on n-ary semigroups and describe quotient n-ary semigroups by fuzzy congruences. Some isomorphism theorems about n-ary semigroups are established. Moreover, we discuss a special kind of n-ary semigroups. We also establish relationships between normal fuzzy ideals and fuzzy congruences. In particular, we prove that there exists a prese...

The purpose of this paper is to define the fuzzy quotient group by using some special fuzzy relation which is defined in this study and to prove some basic properties. c ©2003 Yang’s Scientific Research Institute, LLC. All rights reserved.

A (left) quotient of a language L by a word w is the language wL = {x | wx ∈ L}. The quotient complexity of a regular language L is the number of quotients of L; it is equal to the state complexity of L, which is the number of states in a minimal deterministic finite automaton accepting L. An atom of L is an equivalence class of the relation in which two words are equivalent if for each quotien...

The aim of this paper is to introduce the concepts of fuzzy strong h-ideals and fuzzy congruences of hemirings. The quotient hemirings via fuzzy strong h-ideals are investigated. The relationships between fuzzy congruences and fuzzy strong h-ideals of hemirings are discussed. Pay attention to an open question on fuzzy congruences. Finally, the normal fuzzy strong h-ideals of hemirings are explo...