ESTIMATIONS DE LA LONGUEUR DU MOT DE DIAGNOSTIC D'UN AUTOMATE FINISOKOLOVSKIJ MN.1976; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1976; NO 2; PP. 16-21; ABS. ANGL.; BIBL. 4 REF.Article

SOME COMMENTS ON NEIGBORHOOD SIZE FOR TESSELLATION AUTOMATA.AMOROSO S; GUILFOYLE R.1972; INFORM. AND CONTROL; U.S.A.; DA. 1972; VOL. 21; NO 1; PP. 48-55; BIBL. 8 REF.Article

CALCULS DE FREQUENCES SUR LES AUTOMATES FINISKINBER EB.1976; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1976; NO 2; PP. 7-15; ABS. ANGL.; BIBL. 6 REF.Article

ON THE PERIODIC EQUIVALENTS OF FINITE AUTOMATA.GAJEWSKI T.1975; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1975; VOL. 24; NO 10; PP. 991-994; BIBL. 6 REF.Article

MODELE D'APPRENTISSAGE AVEC UNE MEMOIRE CROISSANTETRAKHTENBROT MB.1972; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1972; NO 5; PP. 100-108; BIBL. 4 REF.Serial Issue

TOPOLOGISCHE WORTMENGEN, TOPOLOGISCHE AUTOMATEN, ZUSTANDSENDLICHE, STETIGE ABBILDUNGEN = ENSEMBLES DE MOTS TOPOLOGIQUES, AUTOMATES TOPOLOGIQUES, ETAT FINI, IMAGES STABLESVALK R.1972; MITT. GESELLSCH. MATH. DATENVERARBEIT.; DTSCH.; DA. 1972; NO 19; PP. 1-135; BIBL. 3 P.Serial Issue

BEHAVIORISM, FINITE AUTOMATA, AND STIMULUS RESPONSE THEORY.NELSON RJ.1975; THEORY AND DECIS.; NETHERL.; DA. 1975; VOL. 6; NO 3; PP. 249-267; BIBL. 1 P. 1/2Article

UNIQUE-ENTRY GRAPHS, FLOWCHARTS, AND STATE DIAGRAMS. = GRAPHES A ENTREE UNIQUE, ORGANIGRAMMES ET DIAGRAMMES D'ETATSMYTH MB.1974; INFORM. AND CONTROL.; U.S.A.; DA. 1974; VOL. 25; NO 1; PP. 20-29; BIBL. 7 REF.Article

ZUM AUFFINDEN VON FEEDBACKPARTITIONEN FUER ENDLICHE AUTOMATEN. = SUR LA RECHERCHE DE PARTITIONS FEEDBACK POUR DES AUTOMATES SEQUENTIELS FINISZECH KA.1974; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1974; VOL. 10; NO 8-9; PP. 489-494; ABS. ANGL. RUSSE; BIBL. 5 REF.Article

UEBER AUTOMATENABBILDUNGEN. = DE REPRESENTATIONS CALCULEES PAR DES AUTOMATESALJOSHIN SV.1975; WISSENSCH. Z. HUMBOLDT-UNIV. BERLIN, MATH.-NATURWISSENSCH. REIHE; DTSCH.; DA. 1975; VOL. 24; NO 6; PP. 735-736; ABS. RUSSE ANGL. FR.Article

WALKWISE AND ADMISSIBLE MAPPINGS BETWEEN DIGRAPHS.GELLER DP.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 9; NO 4; PP. 375-390; BIBL. 13 REF.Article

SYNCHRONIZATION OF FINITE AUTOMATADESCHAMPS JP.1972; PHILIPS RES. REP.; NETHERL.; DA. 1972; VOL. 27; NO 2; PP. 126-139; BIBL. 8 REF.Serial Issue

A RELATIONSHIP BETWEEN OUPUT SYMBOL OCCURRENCE RATE AND OBSERVABILITY OF AUTONOMOUS MACHINESMICZO A; RUDOLPH LD.1972; I.E.E.E. TRANS. COMPUTERS.; U.S.A.; DA. 1972; VOL. 21; NO 8; PP. 911-913; BIBL. 3 REF.Serial Issue

ON AN APPLICATION OF LIST PROCESSING TECHNIQUES TO A RECOGNITION PROBLEM.HUZINO S.1975; MEM. FAC. SCI. KYUSHU UNIV., A; JAP.; DA. 1975; VOL. 29; NO 1; PP. 99-104; BIBL. 4 REF.Article

PATTERN SYNCHRONIZATION IN TWO-DIMENSIONAL CELLULAR SPACES.NGUYEN HB; HAMACHER VC.1974; INFORM. AND CONTROL; U.S.A.; DA. 1974; VOL. 26; NO 1; PP. 12-23; BIBL. 8 REF.Article

ON THE ENDOMORPHISMS OF FINITE AUTOMATAGRZYMALA BUSSE JW.1972; MATH. SYST. THEORY; U.S.A.; DA. 1972; VOL. 4; NO 4; PP. 373-384; BIBL. 18 REF.Serial Issue

BEZIEHUNGEN ZWISCHEN EINIGEN SCHWACHEN AQUIVALENZEN ENDLICHER AUTOMATEN = RELATION ENTRE DES EQUIVALENCES FAIBLES D'UN AUTOMATE FINIHUMMITZSCH P.1972; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1972; VOL. 8; NO 2-3; PP. 77-86; ABS. ANGL., RUSSE; BIBL. 4 REF.Serial Issue

METHODE DE CODAGE DES ETATS D'UN AUTOMATE FINI ASYNCHRONESAPOZHNIKOV VV; SAPOZHNIKOV VL V.1972; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; S.S.S.R.; DA. 1972; NO 4; PP. 141-144; BIBL. 3 REF.Serial Issue

LIMITEDNESS THEOREM ON FINITE AUTOMATA WITH DISTANCE FUNCTIONSHASHIGUCHI K.1982; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 2; PP. 233-244; BIBL. 7 REF.Article

ON A PROBLEM IN THE COLLECTIVE BEHAVIOR OF AUTOMATA.VITANYI PMB.1976; DISCRETE MATH.; NETHERL.; DA. 1976; VOL. 14; NO 1; PP. 99-101; BIBL. 4 REF.Article

THE REGULATOR THEORY FOR FINITE AUTOMATA.GATTO M; GUARDABASSI G.1976; INFORM. AND CONTROL; U.S.A.; DA. 1976; VOL. 31; NO 1; PP. 1-16; BIBL. 8 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

UEBER SPEKTREN VON AUTOMATEN. = SUR DES SPECTRES D'AUTOMATESMARKOV SW.1975; WISSENSCH. Z. HUMBOLDT-UNIV. BERLIN, MATH.-NATURWISSENSCH. REIHE; DTSCH.; DA. 1975; VOL. 24; NO 6; PP. 736-737; BIBL. 1 REF.Article

COMPLETENESS PROBLEM OF ONE-DIMENSIONAL BINARY SCOPE-3 TESSELLATION AUTOMATA.MARUOKA A; KIMURA M.1974; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1974; VOL. 9; NO 1; PP. 31-47; BIBL. 11 REF.Article

AUTOMATES FINIS D'APPRENTISSAGETSYPKIN YA Z; POZNYAK AS.1972; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; S.S.S.R.; DA. 1972; NO 3; PP. 127-140; BIBL. 20 REF.Serial Issue