Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Alfabeto")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

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

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 2530

  • Page / 102
Export

Selection :

  • and

Sur une conjecture d'Yves MétivierBERTRAND, A.Theoretical computer science. 1994, Vol 123, Num 1, pp 21-30, issn 0304-3975Conference Paper

The laterality problem for non-erasing turing machines on {0,1} is completely solvedMARGENSTERN, M.Informatique théorique et applications (Imprimé). 1997, Vol 31, Num 2, pp 159-204, issn 0988-3754Article

The identity problem of finitely generated bi-idealsLORENCS, A.Acta informatica. 2012, Vol 49, Num 2, pp 105-115, issn 0001-5903, 11 p.Article

PERIODICITY PROBLEM OF SUBSTITUTIONS OVER TERNARY ALPHABETSBO TAN; WEN, Zhi-Ying.Informatique théorique et applications (Imprimé). 2008, Vol 42, Num 4, pp 747-762, issn 0988-3754, 16 p.Article

DEJEAN'S CONJECTURE AND LETTER FREQUENCYCHALOPIN, Jérémie; OCHEM, Pascal.Informatique théorique et applications (Imprimé). 2008, Vol 42, Num 3, pp 477-480, issn 0988-3754, 4 p.Conference Paper

Substitutions on two letters, cutting segments and their projectionsROSEMA, Sierk W.Journal de théorie des nombres de Bordeaux. 2007, Vol 19, Num 2, pp 523-545, issn 1246-7405, 23 p.Article

Efficient special cases of Pattern Matching with SwapsAMIR, A; LANDAU, G. M; LEWENSTEIN, M et al.Information processing letters. 1998, Vol 68, Num 3, pp 125-132, issn 0020-0190Article

Avicenne et le soufisme : à propos de la Risala nayruziyya = Avicenna and the sufism: on the Risāla nayrūziyyaLORY, P.Bulletin d'études orientales. 1996, Vol 48, pp 137-144, issn 0253-1623, 10 p.Article

The four cases of write unidirectional memory codes over arbitrary alphabetsVAN OVERVELD, W. M. C. J.IEEE transactions on information theory. 1991, Vol 37, Num 3, pp 872-878, issn 0018-9448, 1Article

A fast algorithm for optimum height-limited alphabetic binary treesLARMORE, L. L; PRZYTYCKA, T. M.SIAM journal on computing (Print). 1994, Vol 23, Num 6, pp 1283-1312, issn 0097-5397Article

Unavoidable binary patternsCASSAIGNE, J.Acta informatica. 1993, Vol 30, Num 4, pp 385-395, issn 0001-5903Article

A note on the paper disjunctive languages and compatible ordersITO, M.Informatique théorique et applications (Imprimé). 1991, Vol 25, Num 5, pp 419-421, issn 0988-3754Article

L'acquisition de la lecture: perspective cognitivesALEGRIA, J.Quest Logop. 1988, Vol 3, Num 0019, pp 00099-00121Article

Constructing Proper Codes for Error DetectionKLØVE, Torleiv.IEEE transactions on information theory. 2009, Vol 55, Num 8, pp 3520-3525, issn 0018-9448, 6 p.Article

On codes having no finite completionNGUYEN HUONG LAM.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 6, pp 483-493, issn 0988-3754Article

Graphical major indicesFOATA, D; ZEILBERGER, D.Journal of computational and applied mathematics. 1996, Vol 68, Num 1-2, pp 79-101, issn 0377-0427Article

SYMBOLIC EXTENSIONS IN INTERMEDIATE SMOOTHNESS ON SURFACESBURGUET, David.Annales scientifiques de l'Ecole normale supérieure. 2012, Vol 45, Num 2, pp 337-362, issn 0012-9593, 26 p.Article

Proof of Dejean's conjecture for alphabets with 5, 6, 7, 8, 9, 10 and 11 lettersMOULIN OLLAGNIER, J.Theoretical computer science. 1992, Vol 95, Num 2, pp 187-205, issn 0304-3975Article

Compressed index for dynamic textHON, Wing-Kai; LAM, Tak-Wah; SADAKANE, Kunihiko et al.Data Compression Conference. 2004, pp 102-111, isbn 0-7695-2082-0, 1Vol, 10 p.Conference Paper

Example verifications using alphabet axiomsKORVER, H; SELLINK, A.Formal aspects of computing. 1998, Vol 10, Num 1, pp 43-58, issn 0934-5043Article

Polynomial size test sets for commutative languagesHAKALA, I; KORTELAINEN, J.Informatique théorique et applications (Imprimé). 1997, Vol 31, Num 3, pp 291-304, issn 0988-3754Article

On the average minimal prefix-length of the generalized semi-dycklanguageKEMP, R.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 6, pp 545-561, issn 0988-3754Article

An application of the hough transform to automatic recognition of Berber charactersOULAMARA, A; DUVERNOY, J.Signal processing. 1988, Vol 14, Num 1, pp 79-90, issn 0165-1684Article

The structure of invertible substitutions on a three-letter alphabetBO TAN; WEN, Zhi-Xiong; YIPING ZHANG et al.Advances in applied mathematics (Print). 2004, Vol 32, Num 4, pp 736-753, issn 0196-8858, 18 p.Article

Parallel detection of all palindromes in a stringAPOSTOLICO, A; BRESLAUER, D; ZVI GALIL et al.Theoretical computer science. 1995, Vol 141, Num 1-2, pp 163-173, issn 0304-3975Article

  • Page / 102