Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("AUTOMATE ETAT FINI")

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 651

  • Page / 27
Export

Selection :

  • and

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

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

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

METHODE D'INTERVALLE POUR L'ANALYSE DU COMPORTEMENT D'UN AUTOMATE DEFINI PAR UN SYSTEME DE FONCTIONS D'EXCITATION ET DE SORTIESDEVYATKOV VV; POTEKHIN AI.1972; AVTOMAT. I TELEMEKH.; S.S.S.R.; DA. 1972; NO 5; PP. 85-93; ABS. ANGL.; BIBL. 3 REF.Serial Issue

CONGRUENCES ET AUTOMORPHISMES DES AUTOMATES FINISPERRIN D; PERROT JF.1971; ACTA INFORMAT.; ALLEM.; DA. 1971; VOL. 1; NO 2; PP. 159-172; BIBL. 19 REF.Serial Issue

ON PEBBLE DOES NOT SUFFICE TO SEARCH PLANE LABYRINTHSHOFFMANN F.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 433-444; BIBL. 11 REF.Conference Paper

FIXED BLOTS IN TOLERANCE AUTOMATAWARNER MW.1980; KYBERNETES; GBR; DA. 1980; VOL. 9; NO 3; PP. 193-195; BIBL. 7 REF.Article

A NOTE ON SWEEPING AUTOMATABERMAN P.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; NO 85; PP. 91-97; BIBL. 3 REF.Conference Paper

AN ISOMORPHISM OF COMPLETE DEGREES OF FINITE-STATE TRANSFORMABILITYGORDON HG.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 40; NO 2; PP. 192-204; BIBL. 9 REF.Article

COMPLEXITY OF AUTOMATON IDENTIFICATION FROM GIVEN DATA.GOLD EM.1978; INFORM. AND CONTROL; USA; DA. 1978; VOL. 37; NO 3; PP. 302-320; BIBL. 9 REF.Article

FUNCTIONS ASSOCIATED TO A PARTITION ON STATE SET OF A PROBABILISTIC AUTOMATION.TANDAREANU N.1975; INFORM. AND CONTROL; U.S.A.; DA. 1975; VOL. 28; NO 4; PP. 304-313; BIBL. 2 REF.Article

  • Page / 27