Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("LANGUAGE RECOGNITION")

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 622

  • Page / 25
Export

Selection :

  • and

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

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

TOWARDS SEPARATING NONDETERMINISTIC TIME FROM DETERMINISTIC TIMEKANNAN R.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 235-243; BIBL. 15 REF.Conference Paper

TWO-WAY COUNTER MACHINES AND DIOPHANTINE EQUATIONSGURARI EM; IBARRA OH.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 45-52; BIBL. 8 REF.Conference Paper

A TIME-SPACE TRADEOFF FOR LANGUAGE RECOGNITIONDURIS P; GALIL Z.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 53-57; BIBL. 7 REF.Conference Paper

ON BRANCHING AND LOOPING, PART IIMAVEL IM.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 10; NO 3; PP. 273-295; BIBL. 6 REF.Article

RELATIVE SUCCINCTNESS OF REPRESENTATIONS OF LANGUAGES AND SEPARATION OF COMPLEXITY CLASSESHARTMANIS J; BAKER TP.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 70-88; BIBL. 11 REF.Conference Paper

RECONNAISSANCE DES LANGAGES SUR DES AUTOMATES FINIS PROBABILISTES A TETES ET A BANDES MULTIPLESFREJVALD RV.1979; PROBL. PEREDACHI INFORM.; SUN; DA. 1979; VOL. 15; NO 3; PP. 99-106; BIBL. 5 REF.Article

RECONNAISSANCE DES LANGAGES SUR DES MACHINES DE TURING PROBABILISTES EN TEMPS REEL ET SUR DES AUTOMATES A MEMOIRE ET A PILEFREJVALD RV.1979; PROBL. PEREDACHI INFORM.; SUN; DA. 1979; VOL. 15; NO 4; PP. 96-101; BIBL. 11 REF.Article

RECONNAISSANCE DES LANGAGES FORMELS SUR LES AUTOMATES ITERATIFS UNIDIMENSIONNELSPLESNEVICH GS.1978; KIBERNETIKA; UKR; DA. 1978; NO 4; PP. 29-36; ABS. ENG; BIBL. 8 REF.Article

LANGUAGE RECOGNITION ABILITIES OF SEVERAL TWO-DIMENSIONAL TAPE AUTOMATA AND THEIR RELATION TO TAPE COMPLEXITIESMORITA K; UMEO H; SUGATA K et al.1977; SYST. COMPUTERS CONTROLS; USA; DA. 1977 PUBL. 1979; VOL. 8; NO 6; PP. 58-65Article

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

THE DEVELOPMENT OF FAST CELLULAR PATTERN TRANSFORMATION ALGORITHMS USING VIRTUAL BOUNDARIESPECHT J.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 111; PP. 189-202; BIBL. 7 REF.Conference Paper

A SPACE BOUND FOR ONE-TAPE MULTIDIMENSIONAL TURING MACHINESLOUI MC.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 15; NO 3; PP. 311-320; BIBL. 9 REF.Article

  • Page / 25