Construction et utilisation d'un modèle fonctionnel à un pas d'automate asynchroneBAJDA, V. D; MATROSOVA, A. YU.Avtomatika i telemehanika. 1984, Num 5, pp 117-124, issn 0005-2310Article

Sur les automates circulaires et la conjecture de ČernÝ = On circular automata and ČernÝ conjectureDUBUC, L.Informatique théorique et applications (Imprimé). 1998, Vol 32, Num 1-3, pp 21-34, issn 0988-3754Article

A note on fairness in I/O automataROMIJN, J; VAANDRAGER, F.Information processing letters. 1996, Vol 59, Num 5, pp 245-250, issn 0020-0190Article

«Automates et contraintes ensemblistes» = «Automata and set constraints»Tommasi, Marc; Tison, Sophie.1994, 138 p.Thesis

Varieties of finite monoids and Büchi-McNaughton theoremDO LONG VAN; PHAN TRUNG HUY.Theoretical computer science. 1992, Vol 98, Num 2, pp 321-337, issn 0304-3975Article

Infinitary tree languages recognized by ω-automataSAOUDI, A.Information processing letters. 1984, Vol 18, Num 1, pp 15-19, issn 0020-0190Article

Automata and currencyPRIESE, L.Theoretical computer science. 1983, Vol 25, Num 3, pp 221-265, issn 0304-3975Article

Computation of partial automata through span compositionGIRARDI ROGGIA, Karina; AUGUSTO HOFF, Marnes; BLAUTH MENEZES, Paulo et al.Lecture notes in computer science. 2005, pp 15-20, issn 0302-9743, isbn 3-540-29002-8, 1Vol, 6 p.Conference Paper

Trade-off results for connection managementMAVRONICOLAS, M; PAPADAKIS, N.Lecture notes in computer science. 1997, pp 340-351, issn 0302-9743, isbn 3-540-63386-3Conference Paper

Separating words with machines and groupsROBSON, J. M.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 1, pp 81-86, issn 0988-3754Article

Enzymes as molecular automata : a reflection on some numerical and philosophical aspects of the hypothesisMARIJUAN, P. C; WESTLEY, J.Biosystems. 1992, Vol 27, Num 2, pp 97-113, issn 0303-2647Article

Left ideals and reachability in machinesHOFER, G.Theoretical computer science. 1989, Vol 68, Num 1, pp 49-56, issn 0304-3975Article

Processus dynamiques dans les automates à actions périodiquesLEVIN, V. I.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1986, Num 1, pp 81-93, issn 0002-3388Article

On the power of alternation in automata theoryHROMKOVIC, J.Journal of computer and system sciences (Print). 1985, Vol 31, Num 1, pp 28-39, issn 0022-0000Article

Automata in categories and regular languagesKAWAHARA, Y.Memoirs of the Faculty of Science. Kyushu University. Series A : Mathematics. 1984, Vol 38, Num 1, pp 47-59, issn 0373-6385Article

Approche algébrique de l'analyse des systèmes à automates de graphes interconnectés avec des liaisons très simplesMIKHAJLOV, G. I; RUDNEV, V. V.Avtomatika i telemehanika. 1984, Num 5, pp 113-116, issn 0005-2310Article

Automate d'arbres infinis et choix borélienSIMONNET, P.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1993, Vol 316, Num 1, pp 97-100, issn 0764-4442Article

Equations over finite sets of words and equivalence problems in automata theory = Equations sur les ensembles finis de mots et problèmes d'équivalence en théorie d'automateKARHUMÄKÏ, J.Theoretical computer science. 1993, Vol 108, Num 1, pp 103-118, issn 0304-3975Conference Paper

Partial memoization for obtaining linear time behavior of a 2DPDAAMTOFT, T; TRÄFF, J. L.Theoretical computer science. 1992, Vol 98, Num 2, pp 347-356, issn 0304-3975Article

Filter automata admitting oscillating carrier wavesFUCHSSTEINER, B.Applied mathematics letters. 1991, Vol 4, Num 6, pp 23-26, issn 0893-9659Article

Troncature effective de la procédure de détection des signaux fluctuants dans un automate à tactique linéaireDOLININ, N. A.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 4, pp 223-225, issn 0002-3388Article

Quantitative relativizations of complexity classesBOOK, R. V; LONG, T. J; SELMAN, A. L et al.SIAM journal on computing (Print). 1984, Vol 13, Num 3, pp 461-487, issn 0097-5397Article

Automates asymptotiquement optimaux à mémoire croissante dans un milieu stationnaireKOLNOGOROV, A. V.Avtomatika i telemehanika. 1984, Num 9, pp 129-137, issn 0005-2310Article

A variant of the public key cryptosystem FAPKC3RENJI TAO; SHIHUA CHEN.Journal of network and computer applications. 1997, Vol 20, Num 3, pp 283-303, issn 1084-8045Article

Recognizable subsets of the two letter plactic monoidARNOLD, A; KANTA, M; KROB, D et al.Information processing letters. 1997, Vol 64, Num 2, pp 53-59, issn 0020-0190Article