Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("AUTOMATE MOORE")

Document Type [dt]

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

Publication Year[py]

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

Language

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

Results 1 to 19 of 19

  • Page / 1
Export

Selection :

  • and

CONDITIONS DE COMPLETUDE DES SYSTEMES D'AUTOMATES DE MOORE FAIBLEMENT INITIAUXDONIS AA.1972; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1972; NO 3; PP. 36-53; ABS. ANGL.; BIBL. 10 REF.Serial Issue

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

PRACTICAL DECOMPOSITION OF AUTOMATA.NOZAKI A.1978; INFORM. AND CONTROL; U.S.A.; DA. 1978; VOL. 36; NO 3; PP. 275-291; BIBL. 8 REF.Article

DISCRETE AND CONTINUOUS REALIZATIONS OF GENERAL TIME SYSTEMS.VALK R.1974; J. CYBERN.; U.S.A.; DA. 1974; VOL. 4; NO 4; PP. 43-52; BIBL. 11 REF.Article

AUTOMATES NON DETERMINISTES BILATERAUXKOLODIJ AN.1974; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1974; NO 5; PP. 40-45; BIBL. 5 REF.Article

IDENTIFIZIERUNGSEXPERIMENTE AN DETERMINIERTEN AUTOMATEN MIT UNTERSCHEIDUNGSFORMEN FUER AUSGABEWOERTER. = EXPERIENCES D'IDENTIFICATION POUR DES AUTOMATES DETERMINISTES A L'AIDE DE FORMES DE DISTINCTION POUR LES MOTS DE SORTIEBURKHARD HD.1975; WISSENSCH. Z. HUMBOLDT-UNIV. BERLIN, MATH.-NATURWISSENSCH. REIHE; DTSCH.; DA. 1975; VOL. 24; NO 6; PP. 739-742; ABS. RUSSE ANGL. FR.; BIBL. 6 REF.Article

ON THE EQUIVALENCE OF MEALY-TYPE AND MOORE-TYPE AUTOMATA AND A RELATION BETWEEN REDUCIBILITY AND MOORE-REDUCIBILITY.FLEISCHNER H.1977; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1977; VOL. 14; NO 1; PP. 1-16; BIBL. 6 REF.Article

CONSTRUCTION D'UN DISPOSITIF DE COMMANDE D'UN CALCULATEUR NUMERIQUE A PARTIR DE L'AUTOMATE DE MOORE AVEC PLUSIEURS SORTIESKOSINSKIJ VA; FEDOROVA NF.1974; MIKROELEKTRONIKA; S.S.S.R.; DA. 1974; VOL. 3; NO 5; PP. 429-436; BIBL. 1 REF.Article

ECONOMICAL SYNTHESIS OF REGULAR EXPRESSIONS FOR LARGE-STATE SEQUENTIAL MACHINESBABU THOMAS; CHANDRASEKHARAN PC.1981; INT. J. ELECTRON. THEOR. EXP.; ISSN 0020-7217; GBR; DA. 1981; VOL. 51; NO 3; PP. 241-246; BIBL. 4 REF.Article

DYNAMIC TESTING OF CONTROL UNITS = ESSAIS DYNAMIQUES D'UNITES DE COMMANDEROBACH C; SAUCIER G.1978; I.E.E.E. TRANS. COMPUTERS; USA; DA. 1978; VOL. 27; NO 7; PP. 617-623; BIBL. 13 REF.Article

DESIGN OF WEIGHTED COUNTERS WITH RATIONAL SCALE USING CONTINUED FRACTION EXPANSION.VAN LANTSCHOOT EJ; VANDEWALLE JP.1974; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1974; VOL. 23; NO 3; PP. 232-238; BIBL. 12 REF.Article

TRANSITION MATRICES IN THE MEASUREMENT AND CONTROL OF SYNCHRONOUS SEQUENTIAL MACHINESDAS SR; SHENG CL; ZEN CHEN et al.1979; INFORM. SCI.; USA; DA. 1979; VOL. 18; NO 1; PP. 47-65; BIBL. 13 REF.Article

TRANSFORMERS OF MARKOV CHAINS.LORENC AA.1976; INFORM. AND CONTROL; U.S.A.; DA. 1976; VOL. 31; NO 4; PP. 295-311; BIBL. 1 P. 1/2Article

SINTESIS MODULAR DE NAQUINAS SECUENCIALES SINCRONAS = SYNTHESE MODULAIRE DES MACHINES SEQUENTIELLES SYNCHRONESLOPEZ ALIGUE J; FERNANDEZ CENTENO M.1980; REV. R. ACAD. CIENC. EXACTAS FIS. NAT. MADRID; ISSN 0034-0596; ESP; DA. 1980; VOL. 74; NO 2; PP. 317-320; ABS. ENGArticle

MINIMAL DETECTING TRANSITION SEQUENCES: APPLICATION TO RANDOM TESTINGDAVID R; THEVENOD FOSSE P.1980; IEEE TRANS. COMPUT.; ISSN 0018-9340; USA; DA. 1980; VOL. 29; NO 6; PP. 514-518; BIBL. 12 REF.Article

TEST EN LIGNE DES SYSTEMES SEQUENTIELS PAR LA METHODE DE L'INVERSE.GIAMBIASI N.1977; R.A.I.R.O., AUTOMAT.; FR.; DA. 1977; VOL. 11; NO 2; PP. 195-212; ABS. ANGL.; BIBL. 5 REF.Article

EIN STOCHASTICHES MODELL DES LINEAREN GLEICHUNGSSYSTEMS FUER DIE RAUSCHOPTIMIERUNG LINEARER NETZWERKE. = UN MODELE STOCHASTIQUE DU SYSTEME LINEAIRE D'EQUATIONS DESTINE A L'OPTIMISATION DU BRUIT DES RESEAUX LINEAIRESNEIDENOFF A.1975; WISSENSCH. Z. HOCHSCH. VERK.-WES. "FRIEDRICH LIST" DRESDEN; DTSCH.; DA. 1975; VOL. 22; NO 2; PP. 475-489; H.T. 1; BIBL. 11 REF.Article

UNIVERSAL MODULAR TREES: A DESIGN PROCEDURE = ARBRES MODULAIRES UNIVERSELS: PROCEDURE DE CONCEPTIONTHOMPSON RA; GRAY FG.1978; I.E.E.E. TRANS. COMPUTERS; USA; DA. 1978; VOL. 27; NO 1; PP. 53-63; BIBL. 17 REF.Article

PROGRAMME DE SIMULATION ET D'ANALYSE DES SCHEMAS A RESEAUX DE PETRI, EN LANGAGE APL.RENALIER J; AZEMA P; VALETTE R et al.sdIN: RESEAUX PETRI. JOURN. ETUD. RESEAUX PETRI; PARIS; 1977; PARIS; INST. PROGRAMMATION; DA. S.D.; PP. 73-87; ABS. ANGL.; BIBL. 1 REF.Conference Paper

  • Page / 1