Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("AUTOMATE DETERMINISTE")

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 659

  • Page / 27
Export

Selection :

  • and

SOME REMARKS ON THE EXTENSION OF A FINITE SET OF STOCHASTIC AUTOMATA.JANICKI S; SZYNAL D.1975; ZASTOSOW. MAT.; POLSKA; DA. 1975; VOL. 14; NO 4; PP. 549-564; ABS. POL.; BIBL. 14 REF.Article

ON 3-HEARD VERSUS 2-HEAD FINITE AUTOMATA.IBARRA OH; KIM CE.1975; ACTA INFORMAT.; ALLEM.; DA. 1975; VOL. 4; NO 2; PP. 193-100; BIBL. 5 REF.Article

PREDECESSOR MACHINES. = MACHINES DE PRECEDENCEFISCHER PC.1974; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1974; VOL. 8; NO 2; PP. 190-219; BIBL. 10 REF.Article

OPTIMALSTEUERUNG MIT DIGITAL-ARBEITENDEN SYSTEMEN. = COMMANDE OPTIMALE AVEC DES SYSTEMES FONCTIONNANT NUMERIQUEMENTFELLBERG G.1974; Z. ELEKTR. INFORM.-U. ENERGIETECH.; DTSCH.; DA. 1974; VOL. 4; NO 6; PP. 350-352; BIBL. 3 REF.Article

UBER DIE EXPERIMENTMENGEN DETERMINIERTER AUTOMATEN = SUR LES AUTOMATES DETERMINISTESSTARKE PH.1972; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1972; VOL. 8; NO 2-3; PP. 67-76; ABS. ANGL., RUSSE; BIBL. 3 REF.Serial Issue

CIRCUITS SEQUENTIELS ANTITONIQUES AUTONOMES. MINIMISATIONSTARODUBTSEV NA.1981; IZV. AKAD. NAUK SSSR, TEH. KIBERN.; ISSN 0002-3388; SUN; DA. 1981; NO 6; PP. 82-86; BIBL. 4 REF.Article

UEBER EINIGE GRUNDLAGEN FUER EINE ALLGEMEINE THEORIE DETERMINISTISCHER SYSTEME. = QUELQUES BASES POUR UNE THEORIE GENERALE DES SYSTEMES DETERMINISTESLOCKE M; IHLE E.1978; Z. ELEKTR. INFORM.-U. ENERGIETECH.; DTSCH.; DA. 1978; VOL. 8; NO 1; PP. 51-60; BIBL. 8 REF.Article

VARIOUS KINDS OF AUTOMATA WITH WEIGHTS.MIZUMOTO M; TOYODA J; TANAKA K et al.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 2; PP. 219-236; BIBL. 21 REF.Article

THE EQUIVALENCE PROBLEM FOR DETERMINISTIC FINITE-TURN PUSHDOWN AUTOMATA.VALIANT LG.1974; INFORM. AND CONTROL; U.S.A.; DA. 1974; VOL. 25; NO 2; PP. 123-133; BIBL. 6 REF.Article

NOMBRE DE TOURS DE LA TETE A PILE D'UN AUTOMATE MP A DEUX VOIES AVEC MEMOIREBARASHKO AS.1974; KIBERNETICA, U.S.S.R.; S.S.S.R.; DA. 1974; NO 4; PP. 9-14; ABS. ANGL.; BIBL. 6 REF.Article

A DIRECT BRANCHING ALGORITHM FOR CHECKING EQUIVALENCE OF SOME CLASSES OF DETERMINISTIC PUSHDOWN AUTOMATATOMITA E.1982; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 52; NO 2; PP. 187-238; BIBL. 23 REF.Article

MINIMIZATION OF DETERMINISTIC TREE GRAMMARS AND AUTOMATA.BARRERO A; GONZALEZ RC.1976; IN: CONF. DECIS. CONTROL. SYMP. ADAPT. PROCESSES. 15. PROC.; CLEARWATER, FLA.; 1976; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1976; PP. 404-407; BIBL. 8 REF.Conference Paper

ONE-WAY MULTIHEAD WRITING FINITE AUTOMATA.SUDBOROUGH IH.1976; INFORM. AND CONTROL; U.S.A.; DA. 1976; VOL. 30; NO 1; PP. 1-20; BIBL. 18 REF.Article

ABSTRAKTE KRYPTOGRAPHISCHE MASCHINEN. = MACHINE ABSTRAITE CRYPTOGRAPHIQUEECKER A.1975; ANGEW. INFORMAT.; DTSCH.; DA. 1975; NO 5; PP. 201-205; ABS. ANGL.; BIBL. 8 REF.Article

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

METHODE D'ETUDE ASYMPTOTIQUE DES JEUX D'AUTOMATESGURVICH ET.1975; AVTOMAT. I TELEMEKH.; S.S.S.R.; DA. 1975; NO 2; PP. 80-94; ABS. ANGL.; BIBL. 12 REF.Article

OPERATION DE FERMETURE SUR L'ENSEMBLE DES ETATS D'UN AUTOMATE INCOMPLETEMENT DETERMINEKORNOUSHENKO EK.1976; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1976; NO 1; PP. 9-15; ABS. ANGL.; BIBL. 4 REF.Article

UEBER DIE ZERLEGUNG STOCHASTISCHER AUTOMATEN. = SUR LA DECOMPOSITION DES AUTOMATES STOCHASTIQUESTRIES B.1975; ANGEW. INFORMAT.; DTSCH.; DA. 1975; NO 12; PP. 514-516; ABS. ANGL.; BIBL. 6 REF.Article

ZUR THEORIE LINEARER AUTOMATEN. = SUR LA THEORIE DES AUTOMATES LINEAIRESSTREICH WJ.1975; ELEKTRON. INFORM.-VERARBEIT KYBERN.; DTSCH.; DA. 1975; VOL. 11; NO 10-12; PP. 575; (INT. SYMP. DISKRETE MATH. ANWEND. MATH. KYBERN.; BERLIN; 1974). RESUMEConference Paper

PEBBLE AUTOMATA ON ARRAYS.SHAH AN.1974; COMPUTER GRAPH. IMAGE PROCESSG; U.S.A.; DA. 1974; VOL. 3; NO 3; PP. 236-246; BIBL. 7 REF.Article

SYNCHRONOUS TO ASYNCHRONOUS TRANSFORMATION OF POLYAUTOMATANAKAMURA K.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 23; NO 1; PP. 22-37; BIBL. 14 REF.Article

PROJECTIVE LIMITS IN THE CATEGORIES OF HETEROGENEOUS ALGEBRAS AND ABSTRACT AUTOMATAVASILACH S.1978; R.C. CIRCOLO MAT. PALERME; ITA; DA. 1978 PUBL. 1979; VOL. 27; NO 2; PP. 210-228; BIBL. 3 REF.Article

DETERMINISTIC ONE-COUNTER AUTOMATA.VALIANI LG; PATERSON MS.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 3; PP. 340-350; BIBL. 6 REF.Article

ON THE DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC PUSHDOWN AUTOMATA.TANIGUCHI K; KASAMI T; SUGIYAMA Y et al.1975; SYST. COMPUTERS CONTROLS; U.S.A.; DA. 1975; VOL. 6; NO 1; PP. 36-44; BIBL. 10 REF.Article

THEORY OF COMPUTING.1975; IN: 8TH HAWAII INT. CONF. SYST. SCI. PROC.; HONOLULU; 1975; NORTH HOLLYWOOD; WESTERN PERIODICALS CO.; DA. 1975; PP. 1-18; BIBL. DISSEM.Conference Paper

  • Page / 27