We consider finite rectangular algebras of finite type as tree recognizers. The type is represented by a ranked alphabet Σ. We determine the varieties of finite rectangular Σ-algebras and show that they form a Boolean lattice in which the atoms are minimal varieties of finite Σ-algebras consisting of projection algebras. We also describe the corresponding varieties of Σ-tree languages and compa...

The problem of generating checking sequences for FSMs with distinguishing sequence has been attracting interest of researchers for several decades. In this paper, a solution is proposed for partial reduced FSMs with distinguishing sets, and either with or without reset feature. Sufficient conditions for a sequence to be a checking sequence for such FSMs are formulated. Based on these conditions...

We study the family of languages accepted by the integer weighted nite automata. Especially the closure properties of this family are investigated.

The integration of multiword expressions in a parsing procedure has been shown to improve accuracy in an artificial context where such expressions have been perfectly pre-identified. This paper evaluates two empirical strategies to integrate multiword units in a real constituency parsing context and shows that the results are not as promising as has sometimes been suggested. Firstly, we show th...

We present a new method for the synthesis-forinitializability of asynchronous state machines. Unlike existing approaches, our method incorporates a state assignment step. State assignment is critical, since initializability may be precluded by poor choice of state assignment. Also, we present precise conditions on hazard-free logic, to insure that the circuits are physically initializable.

In previous work, we presented an annotation scheme that can describe complex disfluencies. In this paper, we first show the prevalence of complex disfluencies and illustrate the types of distinctions that our scheme allows. Second, we present an annotation tool that allows the scheme to be easily applied. Third, we present the results of a reliability study in annotating complex disfluencies w...

LetP beanarbitrary,butxedpermutationon0:: N), withN0. Inthispaperwedesi gn a paral l el program that determines for each segment of N successive elements of its input sequence whether it is invariant under P. The program consists of a linear arrangement of cel l s and contains|in addition to links between neighbour cells|connections between cel l s thatare arbitrarilyfar apart. For some well-kn...

-The recent trend in packet processing is to use packet processors. Although packet processors are programmable and can handle protocol changes easily, their complexity and cost is also very high. Some tasks only need mild programmability that can’t justify the use of a commercial packet processor, and a different approach is needed. A Programmable State Machine (PSM) described in this paper re...