513 search results - page 45 / 103 » Finitely Based, Finite Sets of Words |
TCS
2008
14 years 11 months ago
2008
We prove that it is decidable whether a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple ...
115
click to vote
ISCI
2002
14 years 11 months ago
2002
This paper presents a framework for the study of generalizing the standard notion of equivalence relation in rough set approximation space with various categories of k-step neighb...
COLING
2000
15 years 1 months ago
2000
We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as ...
PKC
2000
Springer
15 years 3 months ago
2000
Springer
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
116
click to vote
NC
1998
15 years 1 months ago
1998
This paper reports the results of experiments in complex Arabic phonetic features identification using a rulebased system (SARPH) and modular connectionist architectures. The firs...