Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("AUTOMATE ACCEPTEUR")

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 116

  • Page / 5
Export

Selection :

  • and

L-FUZZY FUNCTORIAL AUTOMATATRNKOVA V.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 463-473; BIBL. 12 REF.Conference Paper

AUTOMATES A MEMOIRE A PLUSIEURS NIVEAUXMASLOV AN.1976; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1976; VOL. 12; NO 1; PP. 55-62; BIBL. 9 REF.Article

REALIZATION IS UNIVERSALGOGUEN JA.1973; MATH. SYST. THEORY; U.S.A.; DA. 1973; VOL. 6; NO 4; PP. 359-374; BIBL. 13 REF.Serial Issue

SOME REMARKS ON ONE-PEBBLE RECTANGULAR ARRAY ACCEPTORSNAKAMURA A.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 2; PP. 80-84; BIBL. 2 REF.Article

ZUFAELLIG AKZEPTIERTE SPRACHEN. = LANGAGES ACCEPTES ALEATOIRESLINDNER R.1975; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1975; VOL. 11; NO 10-12; PP. 617-620; BIBL. 4 REF.; (INT. SYMP. DISKRETE MATH. ANWEND. MATH. KYBERN.; BERLIN; 1974). RESUMEConference Paper

PEBBLE MACHINES AND TREE WALKING MACHINESMORIYA T.1982; INFORMATION SCIENCES (NEW YORK); ISSN 0020-0255; USA; DA. 1982; VOL. 27; NO 2; PP. 99-119; BIBL. 12 REF.Article

SYSTOLIC TREES AND SYSTOLIC LANGUAGE RECOGNITION BY TREE AUTOMATASTEINBY M.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 22; NO 1; PP. 219-232; BIBL. 13 REF.Article

A NOTE ON REBOUND AUTOMATAINOUE K; TAKANAMI I; TANIGUCHI H et al.1982; INF. SCI. (N. YORK); ISSN 0020-0255; USA; DA. 1982; VOL. 26; NO 1; PP. 87-93; BIBL. 4 REF.Article

ECONOMICAL SYNTHESIS OF REGULAR EXPRESSIONS FOR LARGE-STATE SEQUENTIAL MACHINESBABU THOMAS; CHANDRASEKHARAN PC.1981; INT. J. ELECTRON. THEOR. EXP.; ISSN 0020-7217; GBR; DA. 1981; VOL. 51; NO 3; PP. 241-246; BIBL. 4 REF.Article

EQUIVALENCE PROBLEMS FOR MAPPINGS ON INFINITE STRINGSCULIK K II; PACHL JK.1981; INFORM. CONTROL.; ISSN 0019-9958; USA; DA. 1981; VOL. 49; NO 1; PP. 52-63; BIBL. 8 REF.Article

BOUNDED QUERY MACHINES: ON NP AND PSPACEBOOK RV.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 5; NO 1; PP. 27-39; BIBL. 17 REF.Article

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

ONE-WAY WEAK-STACK-COUNTER AUTOMATAMIYANO S.1980; J. COMPUTER SYST. SCI.; USA; DA. 1980; VOL. 20; NO 1; PP. 59-76; BIBL. 13 REF.Article

CLOSURE PROPERTIES OF THE CLASSES OF SETS ACCEPTED BY AUTOMATA ON A TWO-DIMENSIONAL TAPE UNDER TWO OPERATIONSINOUE K; TAKANAMI I.1978; SYST., COMPUT., CONTROLS; ISSN 0096-8765; USA; DA. 1978 PUBL. 1980; VOL. 9; NO 6; PP. 10-17; BIBL. 11 REF.Article

A NOTE ON A FAMILY OF ACCEPTORS FOR SOME FAMILIES OF DEVELOPMENTAL LANGUAGES.ROZENBERG G; WOOD D.1976; INTERNATION. J. COMPUTER MATH.; U.S.A.; DA. 1976; VOL. 5; NO 4; PP. 261-266; BIBL. 6 REF.Article

STRUCTURED STORAGE AFAGABRIELIAN A; GINSBURG S.1973; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1973; VOL. 22; NO 5; PP. 534-537; BIBL. 13 REF.Serial Issue

ON THE FINITE-VALUEDNESS PROBLEM FOR SEQUENTIAL MACHINESTAT HUNG CHAN; IBARRA OH.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 1; PP. 95-101; BIBL. 6 REF.Article

DETERMINANCY OF SINKING AUTOMATA ON INFINITE TREES AND INEQUALITIES BETWEEN VARIOUS RABIN'S PAIR INDICESMOSTOWSKI AW.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 4; PP. 159-163; BIBL. 7 REF.Article

PARALLEL RANDOM ACCESS MACHINES WITH POWERFUL INSTRUCTION SETSSAVITCH W.1982; MATH. SYST. THEORY; ISSN 0025-5661; DEU; DA. 1982; VOL. 15; NO 3; PP. 191-210; BIBL. 14 REF.Article

DIVISION IN IDEALIZED UNIT COST RAMSSIMON J.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 3; PP. 421-441; BIBL. 21 REF.Article

TEAM TOURNAMENTS AND FINITE ELEMENTARY CODESLALLEMENT G; REIS C.1981; INFORM. CONTROL.; ISSN 0019-9958; USA; DA. 1981; VOL. 48; NO 1; PP. 11-29; BIBL. 9 REF.Article

TRIANGLE CELLULAR AUTOMATADYER CR; ROSENFELD A.1981; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 48; NO 1; PP. 54-69; BIBL. 3 REF.Article

ACCEPTORS FOR ISOMETRIC PARALLEL CONTEXT-FREE ARRAY LANGUAGESNAKAMURA A; AIZAWA K.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 4-5; PP. 182-186; BIBL. 5 REF.Article

A REMARK ON TWO-DIMENSIONAL FINITE AUTOMATANAKAMURA A; INOUE K.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 10; NO 4-5; PP. 219-222; BIBL. 4 REF.Article

LINEAR REGULAR SETSMAXSON CJ.1978; ACTA INFORMAT.; DEU; DA. 1978; VOL. 10; NO 2; PP. 203-208; BIBL. 3 REF.Article

  • Page / 5