Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("THEORIE AUTOMATE")

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 1096

  • Page / 44
Export

Selection :

  • and

CLOSEDNESS PROPERTIES AND DECISION PROBLEMS FOR FINITE MULTI-TAPE AUTOMATA.STARKE PH.1976; KYBERNETIKA; CESKOSL.; DA. 1976; VOL. 12; NO 2; PP. 61-75; BIBL. 10 REF.Article

DIE RELATIONALE AQUIVALENZ VON AUTAMATEN. = L'EQUIVALENCE RELATIONNELLE DES AUTOMATESWALTER HKG.1976; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1976; VOL. 12; NO 3; PP. 123-131; ABS. ANGL. RUSSE; BIBL. 10 REF.Article

DYNAMICS OF DISCRETE SYSTEMS AND PATTERN REPRODUCTION.RAJLICH V.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 11; NO 2; PP. 186-202; BIBL. 8 REF.Article

EXPERIMENTE MIT AUTOMATEN. = EXPERIENCES AVEC AUTOMATESKARACUBA AA.1975; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1975; VOL. 11; NO 10-12; PP. 611-612; BIBL. 2 REF.; (INT. SYMP. DISKRETE MATH. ANWEND. MATH. KYBERN.; BERLIN; 1974). RESUMEConference Paper

PROGNOSE VON FOLGEN. = PROGNOSTIC DE SUITESWERNER G.1975; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1975; VOL. 11; NO 10-12; PP. 649-653; BIBL. 5 REF.; (INT. SYMP. DISKRETE MATH. ANWEND. MATH. KYBERN.; BERLIN; 1974). RESUMEConference Paper

SUR LA R-EQUIVALENCE D'AUTOMATESDIDIDZE TS E.1975; AKAD. NAUK GRUZ. S.S.R., VYCHISLIT. CENTR, TRUDY; S.S.S.R.; DA. 1975; VOL. 15; NO 1; PP. 10-23; BIBL. 5 REF.Article

SUR QUELQUES PROBLEMES LIES A LA COMPLETUDE DES AUTOMATESBUEVICH VA.1975; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1975; VOL. 11; NO 10-12; PP. 614-617; BIBL. 5 REF.; (INT. SYMP. DISKRETE MATH. ANWEND. MATH. KYBERN.; BERLIN; 1974). RESUMEConference Paper

A CONVENIENT CRYPTOMORPHIC VERSION OF RECURSIVE FUNCTION THEORY.PRATHER RE.1975; INFORM. AND CONTROL; U.S.A.; DA. 1975; VOL. 27; NO 2; PP. 178-195; BIBL. 9 REF.Article

FINITE BRANCHING AUTOMATA.HAVEL IM.1974; KYBERNETIKA; CESKOSL.; DA. 1974; VOL. 10; NO 4; PP. 281-302; BIBL. 6 REF.Article

ON THE STRUCTURE OF THE SEMIGROUPS GENERATED BY LINEAR AUTOMATA.FUZIMOTO S.1974; SYST. COMPUTERS CONTROLS; U.S.A.; DA. 1974; VOL. 5; NO 6; PP. 21-29; BIBL. 7 REF.Article

SUR CERTAINES PSEUDO-VARIETES DE MONOIDES FINIS.SCHUTZENBERGER MP.1974; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1974; NO 62; PP. 1-13; ABS. ANGLArticle

QUASILINEARE AUTOMATEN UND DIE VON IHNEN REALISIERTEN OPERATOREN. = AUTOMATES QUASILINEAIRES ET LES OPERATEURS REALISES A PARTIR DE CEUX-CISTAIGER L.1976; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1976; VOL. 12; NO 1-2; PP. 83-92; ABS. ANGL. RUSSE; BIBL. 9 REF.Article

ON THE STRUCTURE OF POLYNOMIAL TIME REDUCIBILITY.LADNER RE.1975; J. ASS. COMPTG MACHIN.; U.S.A.; DA. 1975; VOL. 22; NO 1; PP. 155-171; BIBL. 25 REF.Article

REPRODUCTION IN TESSELLATION STRUCTURES.HAMILTON WL; MERTENS JR JR.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 2; PP. 248-252; BIBL. 8 REF.Article

STATISTICAL SIMPLIFICATION OF NEURAL NETS.ZEIGLER BP.1975; INTERNATION. J. MAN-MACH. STUD.; G.B.; DA. 1975; VOL. 7; NO 3; PP. 371-393; BIBL. 14 REF.Article

GENERATION OF ALL CLOSED PARTITIONS ON THE STATE SET OF A SEQUENTIAL MACHINE.CHAO CHIH YANG.1974; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1974; VOL. 23; NO 5; PP. 530-533; BIBL. 6 REF.Article

SUR UNE PROPRIETE SYNTACTIQUE DES RELATIONS RATIONNELLES.SCHUETZENBERGER MP.1974; I.R.I.A., LAB. RECH. INFORMAT. AUTOMAT., RAPP. RECH.; FR.; DA. 1974; NO 67; PP. 1-10; ABS. ANGLArticle

A GENERAL DEFINITION OF STOCHASTIC AUTOMATA.PARADAENS JJ.1974; COMPUTING; AUSTR.; DA. 1974; VOL. 13; NO 2; PP. 93-105; ABS. ALLEM.; BIBL. 5 REF.Article

A LANGUAGE INFORMATION THEORY OBLIGATORY RELATIONS.KOENG EC.1974; CYBERNETICA; BELG.; DA. 1974; VOL. 17; NO 1; PP. 57-79; BIBL. 13 REF.Article

BERECHNUNGEN UND DIE KOMPLIZIERTHEIT VON BEZIEHUNGEN. = CALCULS ET COMPLEXITE DES RELATIONSKARACUBA AA.1975; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1975; VOL. 11; NO 10-12; PP. 603-606; BIBL. 4 REF.; (INT. SYMP. DISKRETE MATH. ANWEND. MATH. KYBERN.; BERLIN; 1974). RESUMEConference Paper

RANDOM ENVIRONMENTS AND AUTOMATA.TAKEUCHI A; KITAHASHI T; TANAKA K et al.1975; INFORM. SCI.; U.S.A.; DA. 1975; VOL. 8; NO 2; PP. 141-154; BIBL. 4 REF.Article

REDUKTIONSVERFAHREN FUER UNVOLLSTAENDIG BESTIMMTE AUTOMATEN. = METHODES DE REDUCTION POUR DES AUTOMATES INCOMPLETEMENT EVALUESALBICKI A.1975; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1975; VOL. 11; NO 10-12; PP. 574; (INT. SYMP. DISKRETE MATH. ANWEND. MATH. KYBERN.; BERLIN; 1974). RESUME.Conference Paper

ALGEBRAISCHE EIGENSCHAFTEN LINEARER AUTOMATEN. = PROPRIETES ALGEBRIQUES DES AUTOMATES LINEAIRESECKER K.1974; BER. GESELLSCH. MATH. DATENVERARBEIT.; DTSCH.; DA. 1974; NO 87; PP. 1-30; BIBL. 2 P.Article

THEORIES OF AUTOMATA ON OMEGA -TAPES: A SIMPLIFIED APPROACH. = THEORIES DES AUTOMATES SUR OMEGA -PILES: UNE APPROCHE SIMPLIFIEECHOUEKA Y.1974; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1974; VOL. 8; NO 2; PP. 117-141; BIBL. 11 REF.Article

TOPOLOGICAL AUTOMATA.EHRIG H; KUHNEL W.1974; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., R; FR.; DA. 1974; VOL. 8; NO 3; PP. 73-91; BIBL. 1 P.Article

  • Page / 44