Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("RECONNAISSANCE LANGAGE")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 429

  • Page / 18
Export

Selection :

  • and

MECHANICAL INFERENCE PROBLEMS IN CONTINUOUS SPEECH UNDERSTANDING. = PROBLEMES D'INFERENCE MECANIQUE DANS LA COMPREHENSION DU LANGAGE CONTINUWOODS WA; MAKHOUL J.1974; ARTIF. INTELLIG.; U.S.A.; DA. 1974; VOL. 5; NO 1; PP. 73-91; BIBL. 6 REF.Article

THE EARLEY ALGORITHM AS A PROBLEM REPRESENTATION.MINKER J; VANDERBRUG GJ.1974; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1974; VOL. 3; NO 1; PP. 1-7; BIBL. 9 REF.Article

IMAGES AND PATTERNS = IMAGES ET FORMES1971; IN: AM. FED. INF. PROCESS. SOC. FALL JT COMPUT. CONF. LAS VEGAS, NEV., 1971; MONTVALE, N.J.; AFIPS PRESS; DA. 1971; PP. 135-162; BIBL. 26 REF.Conference Proceedings

PROPERTIES OF PHONEME PAIRS FOR DISTINGUISHING A WORD PAIR WITH A SHORT DISTANCEMAKINO S; KIDO K.1979; SYST. COMPUT. CONTROLS; ISSN 0096-8765; USA; DA. 1979 PUBL. 1981; VOL. 10; NO 4; PP. 39-48; BIBL. 9 REF.Article

STATE-SPACE, PROBLEM-REDUCTION, AND THEOREM PROVING-SOME RELATIONSHIPS.VANDERBRUG GJ; MINKER J.1975; COMMUNIC. A.C.M.; U.S.A.; DA. 1975; VOL. 18; NO 2; PP. 107-115; BIBL. 24 REF.Article

PARALLEL AND SEQUENTIAL SPECIFICATION OF A CONTEXT SENSITIVE LANGUAGE FOR STRAIGHT LINES ON GRIDS.ROTHSTEIN J; WEIMAN C.1976; COMPUTER GRAPH. IMAGE PROCESSG; U.S.A.; DA. 1976; VOL. 5; NO 1; PP. 106-124; BIBL. 21 REF.Article

PREDICTION CONTROL PARSER: EXTENDED LINGOLTANAKA H; SATO T; MOTOYOSHI F et al.1979; IJCAI 79. INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE. 6/1979/TOKYO; USA; S.L.: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE; DA. 1979; VOL. 2; PP. 868-870; BIBL. 6 REF.Conference Paper

GENERAL CONTEXT-FREE RECOGNITION IN LESS THAN CUBIC TIME.VALIANT LG.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 2; PP. 308-315; BIBL. 8 REF.Article

SUR LA REPRESENTABILITE DES LANGAGES DANS LES AUTOMATES DETERMINISTES ET NON DETERMINISTES A UNE INFINITE DENOMBRABLE D'ETATSNASYROV IR.1982; IZV. VYSS. UCEBN. ZAVED., MAT.; ISSN 0021-3446; SUN; DA. 1982; NO 7; PP. 79-80; BIBL. 1 REF.Article

ON CELLULAR AUTOMATA WITH A FINITE NUMBER OF STATE CHANGESVOLLMAR R.1981; COMPUTING; ISSN 0010-485X; AUT; DA. 1981; SUPPL. 3; PP. 181-191; ABS. GER; BIBL. 5 REF.Article

A CIRCUIT-SIZE LOWER BOUNDKANNAN R.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 304-309; BIBL. 13 REF.Conference Paper

LOG DIAMETER RESTRICTED BOTTOM-UP TRIANGLE CELLULAR ACCEPTORSKLETTE R.1980; INF. SCI. (N. YORK); ISSN 0020-0255; USA; DA. 1980; VOL. 22; NO 1; PP. 37-43; BIBL. 2 REF.Article

ON THE COMPLEXITY OF W-TYPE TURING ACCEPTORSCOHEN R; GOLD A.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 10; NO 3; PP. 249-272; BIBL. 19 REF.Article

REFINING NONDETERMINISM IN RELATIVIZED POLYNOMIAL-TIME BOUNDED COMPUTATIONSKINTALA CMR; FISCHER PC.1980; S.I.A.M. J. COMPUTG; USA; DA. 1980; VOL. 9; NO 1; PP. 46-53; BIBL. 8 REF.Article

PARSING DIRECTLY INTO KNOWLEDGE STRUCTURESSCHANK RC; LEBOWITZ M; BIRNBAUM L et al.1979; IJCAI 79. INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE. 6/1979/TOKYO; USA; S.L.: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE; DA. 1979; VOL. 2; PP. 772-777; BIBL. 10 REF.Conference Paper

RECONNAISSANCE DES LANGAGES SUR DES AUTOMATES FINIS DETERMINISTES ET PROBABILISTES A TETES MULTIPLESFREJVALD RV.1979; AVTOMAT. VYCHISLIT. TEKH.; SUN; DA. 1979; NO 3; PP. 15-20; BIBL. 6 REF.Article

SPEED OF RECOGNITION OF CONTEXT-FREE LANGUAGES BY ARRAY AUTOMATA.RAO KOSARAJU S.1975; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1975; VOL. 4; NO 3; PP. 331-340; BIBL. 12 REF.Article

A NOTE ON REPRESENTATIONS OF A CERTAIN MONOIDSQUIER C; WRATHALL C.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 2; PP. 229-231; BIBL. 3 REF.Article

ON THE CONSTRUCTIVE DESCRIPTION OF GRAPH LANGUAGES ACCEPTED BY FINITE AUTOMATAKREOWSKI HJ; ROZENBERG G.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 398-409; BIBL. 5 REF.Conference Paper

SOME NEW RESULTS ON ISOTONIC ARRAY GRAMMARSSHEN PEI WANG P.1980; INFORM. PROCESSG LETTERS; NLD; DA. 1980; VOL. 10; NO 3; PP. 129-131; BIBL. 12 REF.Article

ON TIME HIERARCHIESPAUL WJ.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 19; NO 2; PP. 197-202; BIBL. 7 REF.Article

ON TWO TYPES OF LOOPSHAVEL IM.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 89-107; BIBL. 7 REF.Conference Paper

KELLERAUTOMATEN MIT MEHREREN KELLERN = AUTOMATES REFOULES AVEC PLUSIEURS MEMOIRES DE REFOULEMENTMUENTEFERING P.1979; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DDR; DA. 1979; VOL. 15; NO 8-9; PP. 403-411; ABS. ENG/RUS; BIBL. 6 REF.Article

A TREE SYSTEM APPROACH FOR LINGERPRINT PATTERN RECOGNITION.MOAYER B; KING SUN FU.1976; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1976; VOL. 25; NO 3; PP. 262-274; BIBL. 19 REF.Article

UN SYSTEME MODULAIRE DE COMPREHENSION D'HISTOIRES RACONTEES EN FRANCAISSABAH G; RADY M; SOQUIER L et al.1981; TA INF.; ISSN 0039-8217; FRA; DA. 1981; VOL. 22; NO 2; PP. 3-33; BIBL. 36 REF.Article

  • Page / 18