VALID DATA FOR DESIGN OF HEBREW LANGUAGE INFORMATION PROCESSING EQUIPMENTLADANY SP.1974; IN: INF. UTIL. PROC. 37TH ASIS ANNU. MEET. XI; ATLANTA, GA; 1974; WASHINGTON, D.C.; AM. SOC. INF. SCI.; DA. 1974; PP. 181-186; BIBL. 10REF.Conference Paper

ON THE CHAIN CODE OF A LINEWU LD.1982; IEEE TRANS. PATTERN ANAL. MACH. INTELL.; ISSN 0162-8828; USA; DA. 1982; VOL. 4; NO 3; PP. 347-353; BIBL. 9 REF.Article

PASTIME. A SYSTEM FOR FILE COMPRESSION.HULTGREN J; LARSSON R.1975; TRITA-LIB-4043; SWED.; DA. 1975; PP. 1-17; BIBL. 7 REF.Report

ELABORATION D'UN INDICE DE RESSEMBLANCE ENTRE DEUX CHAINES DE LONGUEUR FINIE, QUELCONQUES; APPLICATION A LA RECONNAISSANCE DE LA PAROLE: RECONNAISSANCE DE MOTS ISOLES A L'AIDE D'UN DICTIONNAIREVIVES R.1973; ANN. TELECOMMUNIC.; FR.; DA. 1973; VOL. 28; NO 3-4; PP. 123-129; BIBL. 8 REF.Serial Issue

IMPLEMENTATION DU LANGAGE DE TRAITEMENT DE CHAINES DE CARACTERES SNOBOLBENKOEL J; LE DUIGOU J.1972; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., B; FR.; DA. 1972; NO 6; PP. 97-122; ABS. ANGL.; BIBL. 4 REF.Serial Issue

A METHOD DEFINING A LIMITED SET OF CHARACTER-STRINGS WITH MAXIMAL COVERAGE OF A SAMPLE OF TEXT.HULTGREN J; LARSSON R.1973; TRITA-LIB-4020 A; SWED.; DA. 1973; PP. 1-9; BIBL. 5 REF.Report

A LONGEST COMMON SUBSEQUENCE ALGORITHM SUITABLE FOR SIMILAR TEXT STRINGSNAKATSU N; KAMBAYASHI Y; YAJIMA S et al.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 18; NO 2; PP. 171-179; BIBL. 6 REF.Article

ON HARRISON'S SUBSTRING TESTING TECHNIQUEBOOKSTEIN A.1973; COMMUNIC. A.C.M.; U.S.A.; DA. 1973; VOL. 16; NO 3; PP. 180-181; BIBL. 1 REF.Serial Issue

A COMMON BASIS FOR SIMILARITY MEASURES INVOLVING TWO STRINGSKASHYAP RL; OOMMEN BJ.1983; INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS; ISSN 0020-7160; GBR; DA. 1983; VOL. 13; NO 1; PP. 17-40; BIBL. 15 REF.Article

THE SHORTEST COMMON SUPERSEQUENCE PROBLEM OVER BINARY ALPHABET IS NP-COMPLETEKARI JOUKO RAIHA; UKKONEN E.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 16; NO 2; PP. 187-198; BIBL. 7 REF.Article

AN OPTIMAL ALGORITHM FOR COMPUTING THE REPETITIONS IN A WORDCROCHEMORE M.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 5; PP. 244-250; BIBL. 7 REF.Article

ON FINDING MINIMAL LENGTH SUPERSTRINGSGALLANT J; MAIER D; STORER JA et al.1980; J. COMPUTER SYST. SCI.; USA; DA. 1980; VOL. 20; NO 1; PP. 50-58; BIBL. 9 REF.Article

ON STRING CONCEPTS AND THEIR IMPLEMENTATION.HOUSDEN RJW.1975; COMPUTER J.; G.B.; DA. 1975; VOL. 18; NO 2; PP. 150-156; BIBL. 15 REF.Article

COMMON PHRASES AND MINIMUM-SPACE TEXT STORAGEWAGNER RA.1973; COMMUNIC. A.C.M.; U.S.A.; DA. 1973; VOL. 16; NO 3; PP. 148-152; BIBL. 6 REF.Serial Issue

SIMILARITY MEASURES BETWEEN STRINGS EXTENDED TO SETS OF STRINGSLEMONE KA.1982; IEEE TRANS. PATTERN ANAL. MACH. INTELL.; ISSN 0162-8828; USA; DA. 1982; VOL. 4; NO 3; PP. 345-347; BIBL. 14 REF.Article

STRING-PROCESSING CHIP DESIGNED IN VLSIBROWN PJ; ROBERTS MD.1981; IEE PROC., E; ISSN 0143-7062; GBR; DA. 1981; VOL. 128; NO 6; PP. 245-249; BIBL. 10 REF.Article

AN EXTENSION TO PASCAL READ AND WRITE PROCEDURESROWLAND DA.1981; SIGPLAN NOT.; ISSN 0362-1340; USA; DA. 1981; VOL. 16; NO 9; PP. 81-82Article

SOME CRITERIA FOR DETERMINING RECOGNIZABILITY OF A SET.BRAINERD WS; KNODE RB.1972; INFORM. AND CONTROL; U.S.A.; DA. 1972; VOL. 21; NO 2; PP. 171-184; BIBL. 16 REF.Article

A STRING EXTENSION FOR PASCALBOSWELL FD; CARMODY MJ; GROVE TR et al.1983; SIGPLAN NOTICES; ISSN 0362-1340; USA; DA. 1983; VOL. 18; NO 2; PP. 57-61; BIBL. 5 REF.Article

ON A CHARACTERIZATION OF PUSHDOWN PERMUTERSSHYAMASUNDAR RK.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 3; PP. 333-341; BIBL. 2 REF.Article

WORST-CASE BEHAVIOR OF STRING-SEARCHING ALGORITHMSTUZA Z.1982; J. STAT. PLANN. INFERENCE; ISSN 0378-3758; NLD; DA. 1982; VOL. 6; NO 1; PP. 99-103; BIBL. 2 REF.Article

BUSQUEDA POR SEMEJANZA = RECHERCHE DE SIMILARITEPARE RC.1982; NOVATICA; ISSN 0211-2124; ESP; DA. 1982; VOL. 8; NO 45-46; PP. 57-65; BIBL. 18 REF.Article

APPLICATIONS OF LOCAL FUNCTIONS IN APLJAFFE SB.1980; APL 80. INTERNATIONAL CONFERENCE ON APL/1980/NOORDWIJKERHOUT; NLD/USA/GBR; AMSTERDAM: NORTH-HOLLAND/NEW YORK: NORTH-HOLLAND/OXFORD: NORTH-HOLLAND; DA. 1980; PP. 97-100Conference Paper

SUR L'EXTENSION DU LANGAGE DE DESCRIPTION DE SYNTAXE (SDL)BANKOWSKI J; FIALKOWSKI K.1975; ARCH. AUTOMAT. TELEMECH.; POLSKA; DA. 1975; VOL. 20; NO 1; PP. 49-58; ABS. RUSSE ANGL.; BIBL. 1 REF.Article

UNIFORMLY GROWING K-TH POWER-FREE HOMOMORPHISMSBRANDENBURG FJ.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 1; PP. 69-82; BIBL. 10 REF.Article