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

The Borel hierarchy is infinite in the class of regular sets of treesSKURCZYNSKI, J.Theoretical computer science. 1993, Vol 112, Num 2, pp 413-418, issn 0304-3975Article

Additive cellular automata and algebraic seriesLITOW, B; DUMAS, P.Theoretical computer science. 1993, Vol 119, Num 2, pp 345-354, issn 0304-3975Article

Les automates finis = Finite-state automataCROCHEMORE, M; PERRIN, D; PIN, J.-E et al.Le Courrier du C.N.R.S. 1993, Num 80, pp 48-51, issn 0153-985XArticle

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

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

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

Generalized automata on infinite trees and Muller-McNaughton's theoremSAOUDI, A.Theoretical computer science. 1991, Vol 84, Num 2, pp 165-177, issn 0304-3975Article

A note on the decomposition of infinite automataTUCCI, R. P.International journal of computer mathematics. 1988, Vol 24, Num 2, pp 141-149, issn 0020-7160Article

Model checking and abstractionKURSHAN, Robert P.Lecture notes in computer science. 2002, pp 1-17, issn 0302-9743, isbn 3-540-43941-2, 17 p.Conference Paper

Real-time generation of primes by a one-dimensional cellular automaton with 11 statesKOREC, I.Lecture notes in computer science. 1997, pp 358-367, issn 0302-9743, isbn 3-540-63437-1Conference Paper

Automata representation by means of behavior fragmentsKOZLOVSKIY, V; GRUNSKY, I.Zeitschrift für angewandte Mathematik und Mechanik. 1996, Vol 76, pp 481-482, issn 0044-2267, SUP3Conference Paper

Les débuts de la théorie des automates = The beginnings of the automata theoryPERRIN, D.TSI. Technique et science informatiques. 1995, Vol 14, Num 4, pp 409-433, issn 0752-4072Article

Efficient simplicity testing of automataSHUHUA ZHANG.Theoretical computer science. 1992, Vol 99, Num 2, pp 265-278, issn 0304-3975Article

Bisections reconnaissables = Recognizable bisectionsDUCHAMP, G; THIBON, J. Y.Informatique théorique et applications (Imprimé). 1988, Vol 22, Num 1, pp 113-128, issn 0988-3754Article

T-fuzzy semiautomata over finite groupsCHO, S.-J; KIM, J.-G; KIM, S.-T et al.Fuzzy sets and systems. 1999, Vol 108, Num 3, pp 341-351, issn 0165-0114Article

Ordre induit sur les automates cellulaires par l'opération de regroupement = Inducing an order on cellular automata by a grouping operationRapaport, Ivan; Mazoyer, Jacques.1998, 80 p.Thesis

Bottom-up tree pushdown automata: classification and connection with rewrite systemsCOQUIDE, J.-L; DAUCHET, M; GILLERON, R et al.Theoretical computer science. 1994, Vol 127, Num 1, pp 69-98, issn 0304-3975Article

Garden of Eden configurations for cellular automata on Cayley graphs of groupsMACHI, A; MIGNOSI, F.SIAM journal on discrete mathematics (Print). 1993, Vol 6, Num 1, pp 44-56, issn 0895-4801Article

Page / 18