Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Palabra finita")

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 212

  • Page / 9
Export

Selection :

  • and

One-rule semi-thue systems with loops of length one, two or threeKURTH, W.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 5, pp 415-429, issn 0988-3754Article

Enumeration of irreducible binary wordsKOBAYASHI, Y.Discrete applied mathematics. 1988, Vol 20, Num 3, pp 221-232, issn 0166-218XArticle

On binary trees and Dyck pathsPANAYOTOPOULOS, A; SAPOUNAKIS, A.Mathématiques, informatique et sciences humaines. 1995, Num 131, pp 39-51, issn 0995-2314Article

Palindromes in sturmian wordsDE LUCA, Aldo; DE LUCA, Alessandro.Lecture notes in computer science. 2005, pp 199-208, issn 0302-9743, isbn 3-540-26546-5, 10 p.Conference Paper

Avoidable sets and well quasi-ordersD'ALESSANDRO, Flavio; VARRICCHIO, Stefano.Lecture notes in computer science. 2004, pp 139-150, issn 0302-9743, isbn 3-540-24014-4, 12 p.Conference Paper

On codes, ω-codes and ω-generatorsJULIA, S; LITOVSKY, I; PATROU, B et al.Information processing letters. 1996, Vol 60, Num 1, pp 1-5, issn 0020-0190Article

A combinatorial approach to collapsing wordsCHERUBINI, A; GAWRYCHOWSKI, P; KISIELEWICZ, A et al.Lecture notes in computer science. 2006, pp 256-266, issn 0302-9743, isbn 3-540-37791-3, 1Vol, 11 p.Conference Paper

Schiitzenberger and eilenberg theorems for words on linear orderingsBEDON, Nicolas; RISPAL, Chloé.Lecture notes in computer science. 2005, pp 134-145, issn 0302-9743, isbn 3-540-26546-5, 12 p.Conference Paper

Periodicity and unbordered words a proof of Duval's conjectureHARJU, Tero; NOWOTKA, Dirk.Lecture notes in computer science. 2004, pp 294-304, issn 0302-9743, isbn 3-540-21236-1, 11 p.Conference Paper

From bidirectionality to alternationPITERMAN, Nir; VARDI, Moshe Y.Lecture notes in computer science. 2001, pp 598-610, issn 0302-9743, isbn 3-540-42496-2Conference Paper

Special factors, periodicity, and an application to Sturmian wordsCARPI, A; DE LUCA, A.Acta informatica. 2000, Vol 36, Num 12, pp 983-1006, issn 0001-5903Article

The k-extension of a Mahonian statisticGUO-NIU HAN.Advances in applied mathematics (Print). 1995, Vol 16, Num 3, pp 297-305, issn 0196-8858Article

Quelques mots sur la droite projective réelle = Some words on real projective lineBOREL, J.-P; LAUBIE, F.Journal de théorie des nombres de Bordeaux. 1993, Vol 5, Num 1, pp 23-51, issn 1246-7405Article

Codes and maximal monoidsSHIN, Sujin.Theoretical computer science. 2010, Vol 411, Num 16-18, pp 1809-1817, issn 0304-3975, 9 p.Article

Algebraic recognizability of languagesWEIL, Pascal.Lecture notes in computer science. 2004, pp 149-175, issn 0302-9743, isbn 3-540-22823-3, 27 p.Conference Paper

A hierarchy of cyclic languagesCARTON, O.Informatique théorique et applications (Imprimé). 1997, Vol 31, Num 4, pp 355-369, issn 0988-3754Article

Codage des polyominos convexes et équations pour l'énumération suivant l'aire = Coding of convex polyominoes and equations for area-based enumerationBOUSQUET-MELOU, M.Discrete applied mathematics. 1994, Vol 48, Num 1, pp 21-43, issn 0166-218XArticle

The complexity of the word-problem for finite matrix ringsSZABO, Csaba; VERTESI, Vera.Proceedings of the American Mathematical Society. 2004, Vol 132, Num 12, pp 3689-3695, issn 0002-9939, 7 p.Article

Forbidden factors and fragment assemblyMIGNOSI, F; RESTIVO, A; SCIORTINO, M et al.Theoretical informatics and applications. 2001, Vol 35, Num 6, pp 565-577Article

Enumeration of bordered words; Enumération des mots à bords = Enumération des mots à bordsREGNIER, Mireille.Rapports de recherche - INRIA. 1988, Vol 956, issn 0249-6399, 12 p.Report

On the repetition threshold for large alphabetsCARPI, Arturo.Lecture notes in computer science. 2006, pp 226-237, issn 0302-9743, isbn 3-540-37791-3, 1Vol, 12 p.Conference Paper

Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in generalOTTO, F.Information processing letters. 1995, Vol 53, Num 5, pp 237-242, issn 0020-0190Article

Synchronized rational relations of finite and infinite words = Relations rationnelles synchronisées des mots finis et infinisFROUGNY, C; SAKAROVITCH, J.Theoretical computer science. 1993, Vol 108, Num 1, pp 45-82, issn 0304-3975Conference Paper

Sum of digits sequences modulo mCUSICK, Thomas W; CIUNGU, Lavinia Corina.Theoretical computer science. 2011, Vol 412, Num 35, pp 4738-4741, issn 0304-3975, 4 p.Article

Finite sets of words and computing : (A Survey)KARHUMÄKI, Juhani.Lecture notes in computer science. 2005, pp 36-49, issn 0302-9743, isbn 3-540-25261-4, 14 p.Conference Paper

  • Page / 9