Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("MEALY AUTOMATON")

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 51

  • 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

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

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

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

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

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

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

TRANSITION MATRICES IN MULTIPLE PRESET EXPERIMENTS AND INITIAL STATE IDENTIFICATION OF SYNCHRONOUS SEQUENTIAL MACHINESDAS SR; PING CHAO; ZEN CHEN et al.1979; ELECTRON. LETTERS; GBR; DA. 1979; VOL. 15; NO 24; PP. 777-779; BIBL. 7 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

Verification of Codiagnosability for Discrete Event Systems Modeled by Mealy Automata With Nondeterministic Output FunctionsTAKAI, Shigemasa; USHIO, Toshimitsu.IEEE transactions on automatic control. 2012, Vol 57, Num 3, pp 798-804, issn 0018-9286, 7 p.Article

Algebraic specification and coalgebraic synthesis of Mealy automataRUTTEN, J. J. M. M.Report - Software engineering. 2005, Num 14, pp 1-16, issn 1386-369X, 16 p.Article

The concept of duality for automata over a changing alphabet and generation of a free group by such automataWORYNA, Adam.Theoretical computer science. 2011, Vol 412, Num 45, pp 6420-6431, issn 0304-3975, 12 p.Article

Test generation derived from model-checkingJERON, T; MOREL, P.Lecture notes in computer science. 1999, pp 108-121, issn 0302-9743, isbn 3-540-66202-2Conference Paper

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

BEITRAG ZUR SYSTEMTHEORETISCHEN BESCHREIBUNG HOCHINTEGRIERTER DIGITALER SCHALTKREISE = CONTRIBUTION A LA DESCRIPTION DES CIRCUITS NUMERIQUES A HAUTE INTEGRATION EN THEORIE DES SYSTEMESROEHN K; ROEHN R.1979; NACHR.-TECH., ELEKTRON.; DDR; DA. 1979; VOL. 29; NO 10; PP. 421-427; ABS. RUS/ENGArticle

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

Synthèse des automates minimaux de Mealy calculant les restes de divisionLADES, V. I.Vesci Akademii navuk BSSR. Seryâ fizika-matematyčnyh navuk. 1987, Num 5, pp 11-15, issn 0002-3574Article

EXPERIENCE D'IDENTIFICATION AVEC UN AUTOMATE DANS LE CAS D'ACCROISSEMENT DU NOMBRE D'ETATSDANILOV VV; ZHIRABOK AN; FILIPPOV FV et al.1980; IZVEST. AKAD. NAUK S.S.S.R., TEKH. KIBERN.; SUN; DA. 1980; NO 2; PP. 96-101; BIBL. 3 REF.Article

REALIZACION DE MAQUINAS SECUENCIALES Y AUTOMATAS MEDIANTE MICROPROCESADORES = REALISATION DE MACHINES SEQUENTIELLES ET D'AUTOMATES AU MOYEN DE MICROPROCESSEURSHERNANDEZ SJL.1980; SCIENTIA (VALPARAISO); ISSN 0036-8679; CHL; DA. 1980; VOL. 45; NO 154; PP. 15-27; ABS. GER; BIBL. 9 REF.Article

  • Page / 3