Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Longitud palabra")

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

Results 1 to 25 of 615

  • Page / 25
Export

Selection :

  • and

The Interval Rank of Monotonic AutomataSHCHERBAK, Tamara.Lecture notes in computer science. 2006, pp 273-281, issn 0302-9743, isbn 3-540-31023-1, 1Vol, 9 p.Conference Paper

ON THE DEGREE OF RAPID DECAYNICA, Bogdan.Proceedings of the American Mathematical Society. 2010, Vol 138, Num 7, pp 2341-2347, issn 0002-9939, 7 p.Article

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

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

On the number of C-words of each lengthWEAKLEY, W. D.Journal of combinatorial theory. Series A. 1989, Vol 51, Num 1, pp 55-62, issn 0097-3165Article

Une caractérisation des fonctions courbes = A characterization of bent functionsCARLET, C; GUILLOT, P.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1995, Vol 321, Num 3, pp 367-370, issn 0764-4442Article

Improved finite word length characteristics in digital control using delta operatorsMIDDLETON, R. H; GOODWIN, G. C.IEEE transactions on automatic control. 1986, Vol 31, Num 11, pp 1015-1021, issn 0018-9286Article

Fine and Wilf's theorem for three periods and a generalization of Sturmian wordsCASTELLI, M. G; MIGNOSI, F; RESTIVO, A et al.Theoretical computer science. 1999, Vol 218, Num 1, pp 83-94, issn 0304-3975Conference Paper

On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State SetVIELHABER, Michael; DEL PILAR CANALES CH, Monica.Lecture notes in computer science. 2006, pp 356-357, issn 0302-9743, isbn 3-540-31023-1, 1Vol, 2 p.Conference Paper

Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary wordsBASIC, Bojan.Discrete applied mathematics. 2012, Vol 160, Num 1-2, pp 181-186, issn 0166-218X, 6 p.Article

Abbreviation recognition with MaxEnt modelKIT, Chunyu; XIAOYUE LIU; WEBSTER, Jonathan J et al.Lecture notes in computer science. 2006, pp 117-120, issn 0302-9743, isbn 3-540-32205-1, 1Vol, 4 p.Conference Paper

The syllable-based word length effect and stimulus set specificityBIRETA, Tamra J; NEATH, Ian; SURPRENANT, Aimée M et al.Psychonomic bulletin & review. 2006, Vol 13, Num 3, pp 434-438, issn 1069-9384, 5 p.Article

A proof of the extended Duval's conjectureHOLUB, Stepan.Theoretical computer science. 2005, Vol 339, Num 1, pp 61-67, issn 0304-3975, 7 p.Conference Paper

Deciding whether a finite set of words has rank at most twoNERAUD, J.Theoretical computer science. 1993, Vol 112, Num 2, pp 311-337, issn 0304-3975Article

On the identity relationships of 2k-p designsJIAHUA CHEN; LIN, D. K. J.Journal of statistical planning and inference. 1991, Vol 28, Num 1, pp 95-98, issn 0378-3758Article

Poly-log diameter bounds for some families of finite groupsDINAI, Oren.Proceedings of the American Mathematical Society. 2006, Vol 134, Num 11, pp 3137-3142, issn 0002-9939, 6 p.Article

Collapsing words vs. synchronizing wordsANANICHEV, D. S; VOLKOV, M. V.Lecture notes in computer science. 2002, pp 166-174, issn 0302-9743, isbn 3-540-43453-4Conference Paper

Periodic-like wordsCARPI, A; DE LUCA, A.Lecture notes in computer science. 2000, pp 264-274, issn 0302-9743, isbn 3-540-67901-4Conference Paper

Random generation of words in an algebraic language in linear binary spaceGOLDWURM, M.Information processing letters. 1995, Vol 54, Num 4, pp 229-233, issn 0020-0190Article

Nonperiodic modes in two-dimensional (2-D) recursive digital filters under finite wordlength effectsBAUER, P; JURY, E. I.IEEE transactions on circuits and systems. 1989, Vol 36, Num 7, pp 1032-1035, issn 0098-4094, 4 p.Article

First large-scale information retrieval experiments on Turkish textsCAN, Fazli; KOCBERBER, Seyit; BALCIK, Erman et al.International ACM SIGIR conference on research and development in information retrieval. 2006, pp 627-628, isbn 1-59593-369-7, 1Vol, 2 p.Conference Paper

The number of binary words avoiding abelian fourth powers grows exponentiallyCURRIE, James D.Theoretical computer science. 2004, Vol 319, Num 1-3, pp 441-446, issn 0304-3975, 6 p.Article

An extension of the periodicity lemma to longer periodsFRAENKEL, Aviezri S; SIMPSON, Jamie.Lecture notes in computer science. 2001, pp 98-105, issn 0302-9743, isbn 3-540-42271-4Conference Paper

On the number of Abelian square-free words on four lettersCARPI, A.Discrete applied mathematics. 1998, Vol 81, Num 1-3, pp 155-167, issn 0166-218XArticle

Finite word length effects on moment of impulse response of digital filterKHARE, A; YOSHIKAWA, T.Electronics Letters. 1992, Vol 28, Num 3, pp 306-307, issn 0013-5194Article

  • Page / 25