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

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

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

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

OMEGA -AUTOMATATOCA A.1979; MATH., MATH.; ROM; DA. 1979; VOL. 21; NO 2; PP. 209-213; BIBL. 6 REF.Article

Efficient analysis of cyclic definitionsNAMJOSHI, K. S; KURSHAN, R. P.Lecture notes in computer science. 1999, pp 394-405, issn 0302-9743, isbn 3-540-66202-2Conference Paper

Extensions and semantics of controller state diagrams for practical applicationsMÜLLER-WIPPERFÜRTH, T.Lecture notes in computer science. 1997, pp 50-57, issn 0302-9743, isbn 3-540-63811-3Conference Paper

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

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

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

Final and sequential behaviours of M-automataCIOBANU, Gabriel; RUDEANU, Sergiu.Acta informatica. 2009, Vol 46, Num 5, pp 361-374, issn 0001-5903, 14 p.Article

Mealy machines are a better model of lexical analyzersYANG, W.Computer languages. 1996, Vol 22, Num 1, pp 27-38, issn 0096-0551Article

Algebraic and coalgebraic aspects of membrane computingCIOBANU, Gabriel; GONTINEAC, Viorel Mihai.Lecture notes in computer science. 2006, pp 181-198, issn 0302-9743, isbn 3-540-30948-9, 1Vol, 18 p.Conference Paper

Stepwise CTL model checking of state/event systemsLIND-NIELSEN, J; ANDERSEN, H. R.Lecture notes in computer science. 1999, pp 316-327, issn 0302-9743, isbn 3-540-66202-2Conference Paper

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 exhaustif de contrôleurs logiques spécifiés en Grafcet: Apports et limites d'une modélisation par machines de MealyPROVOST, Julien; ROUSSEL, Jean-Marc; FAURE, Jean-Marc et al.Journal européen des systèmes automatisés. 2009, Vol 43, Num 7-9, pp 889-904, issn 1269-6935, 16 p.Conference Paper

Verification of large state/event systems using compositionality and dependency analysisLIND-NIELSEN, J; ANDERSEN, H. R; BEHRMANN, G et al.Lecture notes in computer science. 1998, pp 201-216, issn 0302-9743, isbn 3-540-64356-7Conference Paper

ESTIMATION ASYMPTOTIQUE DE LA LONGUEUR DU MOT DE DIAGNOSTIC POUR UN AUTOMATE FINIRYSTSOV IK.1980; KIBERNETIKA; UKR; DA. 1980; NO 2; PP. 31-35; ABS. ENG; BIBL. 4 REF.Article

GENERATING MICROPROGRAM CONTROL SEQUENCES USING LINEAR SEQUENTIAL CIRCUITS.SINTONEN L.1977; DIGIT. PROCESS.; SWITZ.; DA. 1977; VOL. 3; NO 1; PP. 17-34; ABS. FR. ALLEM.; BIBL. 6 REF.Article

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