Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Finite 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


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 2430

  • Page / 98

Selection :

  • and

Simulating one-reversal multicounter machines by partially blind multihead finite automataDECKELBAUM, Alan.Theoretical computer science. 2008, Vol 409, Num 3, pp 411-416, issn 0304-3975, 6 p.Article

Efficient implementation of regular languages using reversed alternating finite automataSALOMAA, K; WU, X; YU, S et al.Theoretical computer science. 2000, Vol 231, Num 1, pp 103-111, issn 0304-3975Conference Paper

A relationship between two-dimensional finite automata and three-way tape-bounded two-dimensional turing machinesINOUE, K; TAKANAMI, I; TANIGUCHI, H et al.Theoretical computer science. 1983, Vol 24, Num 3, pp 331-336, issn 0304-3975Article

One-way multihead finite automata are not closed under concatenationDURIS, P; HROMKOVIC, J.Theoretical computer science. 1983, Vol 27, Num 1-2, pp 121-125, issn 0304-3975Article

Experiments with automata compressionDACIUK, Jan.Lecture notes in computer science. 2001, pp 105-112, issn 0302-9743, isbn 3-540-42491-1Conference Paper

Alternating finite automata on ω-wordsMIYANO, S; HAYASHI, T.Theoretical computer science. 1984, Vol 32, Num 3, pp 321-330, issn 0304-3975Article

Computation of boolean functions on networks of binary automataTCHUENTE, M.Journal of computer and system sciences (Print). 1983, Vol 26, Num 2, pp 269-277, issn 0022-0000Article

On finite automaton public-key cryptosystemRENJI TAO; SHIHUA CHEN.Theoretical computer science. 1999, Vol 226, Num 1-2, pp 143-172, issn 0304-3975Article

The parameterized complexity of intersection and composition operations on sets of finite-state automataWAREHAM, H. Todd.Lecture notes in computer science. 2001, pp 302-310, issn 0302-9743, isbn 3-540-42491-1Conference Paper

Complexity of some problems from the theory of automataSTERN, J.Information and control. 1985, Vol 66, Num 3, pp 163-176, issn 0019-9958Article

Approximation et formation précise des fonctions booléennes de plusieurs variables. I. Volume de mémoire et précision de l'approximationRADCHENKO, A. N.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 1, pp 148-156, issn 0002-3388Article

Equivalence of infinite behavior of finite automataALAIWAN, H.Theoretical computer science. 1984, Vol 31, Num 3, pp 297-306, issn 0304-3975Article

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

One-way multihead deterministic finite automataHROMKOVIČ, J.Acta informatica. 1983, Vol 19, Num 4, pp 377-384, issn 0001-5903Article

One step transformation of periodic sequences by cellular automataYAMADA, H; IMORI, M.SIAM journal on computing (Print). 1983, Vol 12, Num 3, pp 539-550, issn 0097-5397Article

Unboundedness detection for a class of communicating finite-state machinesYAO-TIN YU; GOUDA, M. G.Information processing letters. 1983, Vol 17, Num 5, pp 235-240, issn 0020-0190Article

Subshifts behavior of cellular automata. Topological properties and related languagesCATTANEO, Gianpiero; DENNUNZIO, Alberto.Lecture notes in computer science. 2005, pp 140-152, issn 0302-9743, isbn 3-540-25261-4, 13 p.Conference Paper

Unambiguous automata on bi-infinite wordsCARTON, Olivier.Lecture notes in computer science. 2003, pp 308-317, issn 0302-9743, isbn 3-540-40671-9, 10 p.Conference Paper

Ambainis-Freivalds' algorithm for measure-once automataBERZINA, Aija; BONNER, Richard.Lecture notes in computer science. 2001, pp 83-93, issn 0302-9743, isbn 3-540-42487-3Conference Paper

Representation of autonomous automataBULS, Janis; BUZA, Vaira; GLAUDINS, Roberts et al.Lecture notes in computer science. 2001, pp 372-375, issn 0302-9743, isbn 3-540-42487-3Conference Paper

Représentation des nombres complexes et automates finis = Radix representation of complex numbers and finite automataSafer, Taoufik; Frougny, Christiane.1997, 105 p.Thesis

FIRE Lite : FAs and REs in C++WATSON, B. W.Lecture notes in computer science. 1997, pp 167-188, issn 0302-9743, isbn 3-540-63174-7Conference Paper

Programs with quasi-stable channels are effectively recognizableCECE, G; FINKEL, A.Lecture notes in computer science. 1997, pp 304-315, issn 0302-9743, isbn 3-540-63166-6Conference Paper

Utilisation d'automates pour la prévision = Utilization of automata for forecastingBONE, R; DAGUIN, C; GEORGEVAIL, A et al.ACSEG. Rencontre internationale. 1996, pp 159-164, isbn 2-86939-108-0Conference Paper

Algorithmes de décomposition des automates finis suivant un critère de coordonnéeSIMONOV, V. M.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 3, pp 216-222, issn 0002-3388Article

  • Page / 98