Absorbing and ergodic discretized two-action learning automataOOMMEN, B. J.IEEE transactions on systems, man, and cybernetics. 1986, Vol 16, Num 2, pp 282-293, issn 0018-9472Article

A survey of two-dimensional automata theoryINOUE, K; TAKANAMI, I.Information sciences. 1991, Vol 55, Num 1-3, pp 99-121, issn 0020-0255, 23 p.Article

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

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

Path-equivalent removals of ε-transitions in a genomic weighted finite automatonGIRAUD, Mathieu; VEBER, Philippe; LAVENIER, Dominique et al.Lecture notes in computer science. 2006, pp 23-33, issn 0302-9743, isbn 3-540-37213-X, 1Vol, 11 p.Conference Paper

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

A fast algorithm for constructing a tree automaton recognizing a congruential tree languageVAGVÖLGYI, S.Theoretical computer science. 1993, Vol 115, Num 2, pp 391-399, issn 0304-3975Article

Regular expressions into finite automataBRÜGGEMANN-KLEIN, A.Theoretical computer science. 1993, Vol 120, Num 2, pp 197-213, issn 0304-3975Article

Structural and behavioral equivalence relations in automata networksSAITO, T; NISHIO, H.Theoretical computer science. 1989, Vol 63, Num 2, pp 223-237, issn 0304-3975Article

One-dimensional bounded cellular acceptor with rotated inputs: a relationship between ∧- and ∨-typesTANIGUCHI, H; INOUE, K; TAKANAMI, I et al.Systems and computers in Japan. 1989, Vol 20, Num 3, pp 1-12, issn 0882-1666Article

Determinization of Büchi-automataROGGENBACH, Markus.Lecture notes in computer science. 2002, pp 43-60, issn 0302-9743, isbn 3-540-00388-6, 18 p.Conference Paper

Fundamental properties of bottom-up pushdown tree automataYAMASAKI, K.Systems and computers in Japan. 1990, Vol 21, Num 14, pp 11-22, issn 0882-1666, 12 p.Article

A maximin problem on finite automataCHAMPARNAUD, J.-M; PIN, J.-E.Discrete applied mathematics. 1989, Vol 23, Num 1, pp 91-96, issn 0166-218XArticle

Relating the power of cellular arrays to their closure propertiesIBARRA, O. H; TAO JIANG.Theoretical computer science. 1988, Vol 57, Num 2-3, pp 225-238, issn 0304-3975Article

Top-down tree transducers with deterministic top-down look-aheadFULOP, Z; VAGVOLGYI, S.Information processing letters. 1989, Vol 33, Num 1, pp 3-5, issn 0020-0190Article

On alternating ω-automataLINDSAY, P. A.Journal of computer and system sciences (Print). 1988, Vol 36, Num 1, pp 16-24, issn 0022-0000Article

Borel ranks and wadge degrees of context free ω-languagesFINKEL, Olivier.Lecture notes in computer science. 2005, pp 129-138, issn 0302-9743, isbn 3-540-26179-6, 10 p.Conference Paper

Separating exponentially ambiguous finite automata from polynomially ambiguous finite automataHING LEUNG.SIAM journal on computing (Print). 1998, Vol 27, Num 4, pp 1073-1082, issn 0097-5397Article

Finite-state transducers as regular Böhm treesHUET, G; LAULHERE, H.Lecture notes in computer science. 1997, pp 604-610, issn 0302-9743, isbn 3-540-63388-XConference Paper

New decidability results concerning two-way counter machinesIBARRA, O. H; TAO JIANG; TRAN, N et al.SIAM journal on computing (Print). 1995, Vol 24, Num 1, pp 123-137, issn 0097-5397Article

Alternating automata with start formulasMOSTOWSKI, A. W.Information processing letters. 1990, Vol 35, Num 6, pp 287-290, issn 0020-0190, 4 p.Article

The power of two-way deterministic checking stack automataENGELFRIET, J.Information and computation (Print). 1989, Vol 80, Num 2, pp 114-120, issn 0890-5401Article

Complementation constructions for nondeterministic automata on infinite wordsKUPFERMAN, Orna; VARDI, Moshe Y.Lecture notes in computer science. 2005, pp 206-221, issn 0302-9743, isbn 3-540-25333-5, 16 p.Conference Paper