Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("AUTOMATE MEALY")

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 64

  • Page / 3
Export

Selection :

  • and

SUR UNE APPLICATION DU PRINCIPE POUR MINIMISER L'INTERDEPENDANCE DANS LES AUTOMATES PROBABILISTESMARTIN L; REISCHER C.1980; ANN. DISCRETE MATH.; NLD; DA. 1980; VOL. 8; PP. 189-193; BIBL. 6 REF.Conference Paper

SIMULATION ENDLICHER AUTOMATEN DURCH KETTEN AUS EINFACHEN BAUSTEINAUTOMATEN. = SIMULATION D'AUTOMATES FINIES AU MOYEN DE CHAINES D'AUTOMATES ELEMENTAIRES DE TYPE MODULAIREKOERBER P; OTTMANN T.1974; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1974; VOL. 10; NO 2-3; PP. 133-148; ABS. ANGL. RUSSE; BIBL. 3 REF.Article

STRUCTURE DES REPRESENTATIONS DES AUTOMATES A DIAGNOSTIC DEFINIGRUNSKIJ IS; KOZLOVSKIJ VA.1981; AVTOM. TELEMEH.; ISSN 0005-2310; SUN; DA. 1981; NO 6; PP. 147-153; ABS. ENG; BIBL. 5 REF.Article

FUNCTORIAL RELATIONS BETWEEN SYSTEMATICS.HARAGUCHI M.1978; MEM. FAC. SCI. KYUSHU UNIV., A; JPN; DA. 1978; VOL. 32; NO 1; PP. 53-59; BIBL. 4 REF.Article

OMEGA -AUTOMATATOCA A.1979; MATH., MATH.; ROM; DA. 1979; VOL. 21; NO 2; PP. 209-213; BIBL. 6 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

SUR LE DECHIFFREMENT DES AUTOMATESVASILEVSKIJ MP.1974; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1974; NO 2; PP. 19-23; ABS. ANGL.; BIBL. 6 REF.Article

ALGORITHME D'IDENTIFICATION D'UN AUTOMATE DE MEALY MINIMAL FORTEMENT CONNEXE A UN NOMBRE FINI D'ETATSKRZYWDA L.1974; ALGORYTMY; POLSKA; DA. 1974; VOL. 11; NO 19; PP. 49-70; ABS. RUSSE ANGL.; BIBL. 4 REF.Article

DECOMPOSITION SEQUENTIELLE DES AUTOMATES STOCHASTIQUESAFANAS'EV YU M; KRYSANOV AI; LETUNOV YU P et al.1973; AVTOMAT. I TELEMEKH.; S.S.S.R.; DA. 1973; NO 3; PP. 84-88; ABS. ANGL.; BIBL. 6 REF.Serial Issue

ANALYSE DES ZEITVERHALTENS GEKOPPELTER AUTOMATEN. = ANALYSE DE LA CARACTERISTIQUE TEMPORELLE DES AUTOMATES COUPLESLOOSE J.1976; NACHR.-TECH., ELEKTRON.; DTSCH.; DA. 1976; VOL. 26; NO 6; PP. 204-207; ABS. RUSSE ANGL. FR.; BIBL. 1 REF.Article

CHECKING EXPERIMENTS FOR INCOMPLETELY SPECIFIED SEQUENTIAL MACHINES.FUJIWARA H; NAGAO Y; KINOSHITA K et al.1974; SYST. COMPUTERS CONTROLS; U.S.A.; DA. 1974; VOL. 5; NO 5; PP. 21-27; BIBL. 10 REF.Article

EXPERIENCES DE DIAGNOSTIC POUR DEUX ETATS AVEC DES AUTOMATESKOGAN II.1974; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1974; NO 3; PP. 36-38; ABS. ANGL.; BIBL. 2 REF.Article

SUR LA COMPLEXITE DE LA RECONNAISSANCE DES AUTOMATES-GENERATEURSPODKOLZIN AS.1972; DISKRETN. ANAL.; S.S.S.R.; DA. 1972; NO 21; PP. 31-61; BIBL. 2 REF.Serial Issue

Model checking in a microprocessor design projectBARRETT, G; MCISAAC, A.Lecture notes in computer science. 1997, pp 214-225, issn 0302-9743, isbn 3-540-63166-6Conference Paper

CONDITIONS D'UNICITE D'UN AUTOMATE MINIMAL DANS LA CLASSE D'INDISCERNABILITEGRUNSKIJ IS.1981; PROBL. KIBERN.; SUN; DA. 1981; NO 38; PP. 263-268; BIBL. 6 REF.Article

RELATION ENTRE LES AUTOMATES PARTIELS DE MEALY ET DE MOORECHERNYJ DE.1973; IZVEST. VYSSH. UCHEBN. ZAVED., MAT.; S.S.S.R.; DA. 1973; NO 4; PP. 113-119; BIBL. 5 REF.Serial Issue

A compositional rule for hardware design refinementMCMILLAN, K. L.Lecture notes in computer science. 1997, pp 24-35, issn 0302-9743, isbn 3-540-63166-6Conference Paper

ON THE FINITE-VALUEDNESS PROBLEM FOR SEQUENTIAL MACHINESTAT HUNG CHAN; IBARRA OH.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 1; PP. 95-101; BIBL. 6 REF.Article

SUR LA STRUCTURE DES AUTOMATES PROBABILISTESALLARD A.1982; MATH. SLOV.; ISSN 0139-9918; CSK; DA. 1982; VOL. 32; NO 4; PP. 343-348; ABS. RUS; BIBL. 9 REF.Article

SOME DECOMPOSITION OF THE GD-AUTOMATAVASILESCU A.1979; REV. ROUMAINE MATH. PURES APPL.; ROM; DA. 1979; VOL. 24; NO 4; PP. 651-657; BIBL. 4 REF.Article

OUTPUT-EXTENDED SEQUENTIAL MACHINESNADLER M.1979; PROC. I.E.E.E.; USA; DA. 1979; VOL. 67; NO 5; PP. 864-866; BIBL. 2 REF.Article

BERECHNUNG VON WORTFUNKTIONEN AUF DETERMINISTISCHEN N-DIMENSIONALEN ITERATIVEN AUTOMATEN = EVALUATION DES FONCTIONS MOT SUR UN AUTOMATE ITERATIF DETERMINISTE A N DIMENSIONSVU DUY MAN.1978; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DDR; DA. 1978; VOL. 14; NO 7-8; PP. 341-360; ABS. ENG/RUS; BIBL. 9 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

FUNCTIONS REALIZED BY CONSISTENT SEQUENTIAL MACHINESBUTZ AR.1981; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 48; NO 2; PP. 147-191; BIBL. 11 REF.Article

UNIVERSAL ASYNCHRONOUS ITERATIVE ARRAYS OF MEALY AUTOMATABUNING HK; PRIESE L.1980; ACTA INFORMAT.; DEU; DA. 1980; VOL. 13; NO 3; PP. 269-285; BIBL. 17 REF.Article

  • Page / 3