Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("DETERMINISTE")

Filter

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

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

Origin

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

Results 1 to 25 of 7828

  • Page / 314
Export

Selection :

  • and

TURING MACHINES AND THE SPECTRA OF FIRST-ORDER FORMULAS WITH EQUALITYJONES ND; SELMAN AL.sdIN: 4TH ANNU. ACM SYMP. THEORY COMPUT. DENVER, COLO, 1972. PROC.; S.L.; DA. S.D.; PP. 157-167; BIBL. 10 REF.Conference Paper

TWO-WAY NESTED STACK AUTOMATA ARE EQUIVALENT TO TWO-WAY STACK AUTOMATA.BEERI C.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 3; PP. 317-339; BIBL. 9 REF.Article

MODELES DYNAMIQUES DETERMINISTES EN BIOLOGIELEBRETON JD ED; MILLIER C ED; LEGAY JM PREF et al.1982; ; FRA; PARIS: MASSON; DA. 1982; 208 P.; 24 CM; BIBL. 9 P.; ISBN 2-225-75933-2Book

ON NON-DETERMINANCY IN SIMPLE COMPUTING DEVICESHARTMANIS J.1972; ACTA INFORMAT.; ALLEM.; DA. 1972; VOL. 1; NO 4; PP. 336-344; BIBL. 9 REF.Serial Issue

OPTIMAL INVENTORY RULE FOR A LINEAR TREND IN DEMAND WITH A CONSTANT REPLENISHMENT PERIODPHELPS RI.1980; J. OPERAT. RES. SOC.; GBR; DA. 1980; VOL. 31; NO 5; PP. 439-442; BIBL. 3 REF.Article

ON STATIONARITY AND OPTIMALITY IN ARBORESCENT PRODUCTION/INVENTORY SYSTEMSGRAVES SC; SCHWARZ LB.1978; MANAG. SCI.; USA; DA. 1978; VOL. 24; NO 16; PP. 1768-1769; BIBL. 1 REF.Article

ITERATED DETERMINISTIC SUBSTITUTION.ASVELD PRJ; ENGELFRIET J.1977; ACTA INFORMAT.; ALLEM.; DA. 1977; VOL. 8; NO 3; PP. 285-302Article

THE OPTIMAL SIZE OF A STORAGE FACILITY.LEVY J.1974; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1974; VOL. 21; NO 2; PP. 319-326; BIBL. 6 REF.Article

MAZE RECOGNIZING AUTOMATA. (EXTENDED ABSTRACT) = AUTOMATE DE RECONNAISSANCE POUR LABYRINTHE (RESUME DETAILLE)SAVITCH WJ.sdIN: 4TH ANNU. ACM SYMP. THEORY COMPUT. DENVER, COLO, 1972. PROC.; S.L.; DA. S.D.; PP. 151-156; BIBL. 3 REF.Conference Paper

ITERATION THEOREMS FOR FAMILIES OF STRICT DETERMINISTIC LANGUAGESKING KN.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 10; NO 3; PP. 317-333; BIBL. 12 REF.Article

A DECISION METHOD FOR THE EQUIVALENCE OF SOME NON-REAL-TIME DETERMINISTIC PUSHDOWN AUTOMATAUKKONEN E.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 29-38; BIBL. 18 REF.Conference Paper

Le modèle ETC (Erosion des Torrents en Crue), intégrateur des bassins versants torrentiels = ETC (erosion of toorents in spate), an integrating model for torrential catchmentsBROCHOT, S.Séminaire inter-chercheurs. Les modèles au Cemagref : formulation validation pertinence. 1995, 9 p.Conference Paper

SOME RESULTS ON RELATIVIZED DETERMINISTIC AND NONDETERMINISTIC TIME HIERARCHIESMORAN S.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 1; PP. 1-8; BIBL. 10 REF.Article

STRICT INTERPRETATIONS OF DETERMINISTIC PUSHDOWN ACCEPTORSGINSBURG S; KINTALA CMR.1981; MATH. SYST. THEORY; ISSN 0025-5661; DEU; DA. 1981; VOL. 14; NO 3; PP. 229-240; BIBL. 8 REF.Article

NEW PROOFS FOR JUMP DPDA'SLINNA M; PENTTONEN M.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 354-362; BIBL. 5 REF.Conference Paper

RECOGNITION CAPACITY OF FINITE AUTOMATA HAVING ADDITIVE COST FUNCTIONS: NONDETERMINISTIC MODELSMURO S; IBARAKI T; HASEGAWA T et al.1979; SYST. COMPUT. CONTROLS; ISSN 0096-8765; USA; DA. 1979 PUBL. 1981; VOL. 10; NO 4; PP. 21-28; BIBL. 15 REF.Article

A SIMULATION RESULT FOR THE AUXILIARY PUSHDOWN AUTOMATAHARJU T.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 19; NO 2; PP. 119-132; BIBL. 6 REF.Article

NONDETERMINISM AND BOOLEAN OPERATIONS IN PDA'S.WOTSCHKE D.1978; J. COMPUTER SYST. SCI.; USA; DA. 1978; VOL. 16; NO 3; PP. 456-461; BIBL. 16 REF.Article

SOME PROPERTIES OF PREDICATE TRANSFORMERSHOARE CAR.1978; J. ASS. COMPUTG MACHIN.; USA; DA. 1978; VOL. 25; NO 3; PP. 461-480; BIBL. 14 REF.Article

EQUIVALENCE PROBLEMS FOR DETERMINISTIC CONTEXT-FREE LANGUAGES AND MONADIC RECURSION SCHEMES.FRIEDMAN EP.1977; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1977; VOL. 14; NO 3; PP. 344-359; BIBL. 8 REF.Article

ON ATTERNATION. II: A GRAPH THEORETIC APPROACH TO DETERMINISM VERSUS NONDETERMINISMPAUL W; REISCHUK R.1980; ACTA INF.; ISSN 0001-5903; DEU; DA. 1980; VOL. 14; NO 4; PP. 391-403; BIBL. 13 REF.Article

THE EQUIVALENCE PROBLEM FOR REAL-TIME STRICT DETERMINISTIC LANGUAGESOYAMAGUCHI M; HONDA N; INAGAKI Y et al.1980; INFORM. AND CONTROL; USA; DA. 1980; VOL. 45; NO 1; PP. 90-115; BIBL. 17 REF.Article

A HIERARCHY OF DETERMINISTIC LANGUAGESHARRISON MA; YEHUDAI A.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 19; NO 1; PP. 63-78; BIBL. 10 REF.Article

THE TWO-PRODUCT, SINGLE-MACHINE, STATIC DEMAND, INFINITE HORIZON LOT SCHEDULING PROBLEM = LE PROBLEME DE PLANIFICATION DE LA PRODUCTION PAR LOTS POUR DEUX PRODUITS, UNE MACHINE, UNE DEMANDE STATIQUE ET UN HORIZON INFINIBOCTOR FF.1982; MANAGE. SCI.; ISSN 0025-1909; USA; DA. 1982; VOL. 28; NO 7; PP. 798-807; BIBL. 17 REF.Article

LANGUAGES SIMULTANEOUSLY COMPLETE FOR ONE-WAY AND TWO-WAY LOGTAPE AUTOMATAHARTMANIS J; MAHANEY S.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 2; PP. 383-390; BIBL. 11 REF.Article

  • Page / 314