A sequence function alternative representation of state machines.

In the first section of the paper we give general conditions under which a class of recognizable tree languages with a given property can be defined by a class of monoids or semigroups defining the class of string languages having the same property. In the second part similar questions are studied for classes of (DR) tree languages recognized by deterministic root-to-frontier tree recognizers.

This paper presents a general framework for efficient synthesis of supervisors for discrete event systems. The approach is based on compositional minimisation, using concepts of process equivalence. In this context, a large number of ways are suggested how a finite-state automaton can be simplified such that the results of supervisor synthesis are preserved. The proposed approach yields a compa...

Here, the method proposed in [13] for constructing minimal-length checking sequences based on distinguishing sequences is improved. The improvement is based on optimizations of the state recognition sequences and their use in constructing test segments. It is shown that the proposed improvement further reduces the length of checking sequences produced from minimal, completely specified, and det...

This paper introduces methods for describing properties of possibly very large state machines in terms of solutions to recursive functions and applies those methods to computer systems.

Strictly Local Stringsets Membership in a Strictly 2-Local (SL2) stringset (McNaughton and Papert 1971) is determined by the initial symbol, by the pairs of symbols that occur in the string and by the final symbol (independently). Thus they can be specified by giving a set of pairs of symbols drawn from the alphabet augmented by a start and an end marker. The members of the stringset are all an...

This paper describes a morphological analyzer which, when parsing a word, uses two sets of rules: rnles describing the syntax of words, and rules describing facts about orthography.

In this article is presented a detection model of intruders by using an architecture based in agents that imitates the principal aspects of the Immunological System, such as detection and elimination of antigens in the human body. This model is based on the hypothesis of an intruder which is a strange element in the system, whereby can exist mechanisms able to detect their presence. We will use...

We introduce theorems that enable efficient identification of indistinguishable fault pairs in synchronous sequential circuits using an iterative logic array of limited length. These theorems can be used for identifying fault pairs that can be dropped from consideration before diagnostic ATPG starts, thus improving the efficiency of diagnostic ATPG. Experimental results are presented to demonst...