Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("PROPRIETE FERMETURE")

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

Author Country

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

Results 1 to 25 of 73

  • Page / 3
Export

Selection :

  • and

COMPLEXITY CLASSES OF FORMAL LANGUAGES (PRELIMINARY REPORT)BOOK RV.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 43-56; BIBL. 24 REF.Conference Paper

Two theorems about Galiukschov semi-contextual languagesPAUN, G.Kybernetika. 1985, Vol 21, Num 5, pp 360-365, issn 0023-5954Article

Some generalized semi-three systemsNGUYEN XUAN MY.International journal of computer mathematics. 1985, Vol 17, Num 1, pp 25-36, issn 0020-7160Article

Closure properties of the class of uniform sweeping-out transformationKING, J. L.Illinois journal of mathematics. 1992, Vol 36, Num 2, pp 233-237, issn 0019-2082Article

Languages accepted by systolic Y-tree automata : structural characterizations = Langages acceptés par les automates à Y-arbres systoliques : caractérisations structurellesFACHINI, E; MONTI, A; NAPOLI, M et al.Acta informatica. 1992, Vol 29, Num 8, pp 761-778, issn 0001-5903Article

First-order logics: some characterizations and closure propertiesCHOFFRUT, Christian; MALCHER, Andreas; MEREGHETTI, Carlo et al.Acta informatica. 2012, Vol 49, Num 4, pp 225-248, issn 0001-5903, 24 p.Article

An improved line continuation model in human visual perceptionYUNG-SHENG CHEN; SHIH-LIANG CHANG; WEN-HSING HSU et al.Pattern recognition. 1993, Vol 26, Num 6, pp 825-842, issn 0031-3203Article

Localizable constraints for object historiesDONG, G; GINSBURG, S.Theoretical computer science. 1991, Vol 90, Num 2, pp 391-432, issn 0304-3975Article

Büchi context-free languagesESIK, Zoltán; IVAN, Szabolcs.Theoretical computer science. 2011, Vol 412, Num 8-10, pp 805-821, issn 0304-3975, 17 p.Article

Unambiguous recognizable two-dimensional languagesANSELMO, Marcella; GIAMMARRESI, Dora; MADONIA, Maria et al.Informatique théorique et applications (Imprimé). 2006, Vol 40, Num 2, pp 277-293, issn 0988-3754, 17 p.Article

ON MONOTONE FORMULA COMPOSITION OF PERFECT ZERO-KNOWLEDGE LANGUAGESDE SANTIS, Alfredo; DI CRESCENZO, Giovanni; PERSIANO, Giuseppe et al.SIAM journal on computing (Print). 2009, Vol 38, Num 4, pp 1300-1329, issn 0097-5397, 30 p.Article

On notions of regularity for data languagesBJÖRKLUND, Henrik; SCHWENTICK, Thomas.Theoretical computer science. 2010, Vol 411, Num 4-5, pp 702-715, issn 0304-3975, 14 p.Conference Paper

Graph automataBOZAPALIDIS, Symeon; KALAMPAKAS, Antonios.Theoretical computer science. 2008, Vol 393, Num 1-3, pp 147-165, issn 0304-3975, 19 p.Article

Sorted dependency insertion grammarsGRAMATOVICI, Radu; MARTIN-VIDE, Carlos.Theoretical computer science. 2006, Vol 354, Num 1, pp 142-152, issn 0304-3975, 11 p.Conference Paper

Closure properties of locally finite ω-languagesFINKEL, Olivier.Theoretical computer science. 2004, Vol 322, Num 1, pp 69-84, issn 0304-3975, 16 p.Conference Paper

Closure properties of subclasses of ω-regular languages under morphism and inverse morphismMORIYA, T.International journal of computer mathematics. 1992, Vol 45, Num 1-2, pp 61-68, issn 0020-7160Article

Formes bilinéaires hankéliennes compactes sur H2(X) x H2(Y) = Compact Hankel bilinear forms on H2(X)×H2(Y)LE MERDY, C.Mathematische Annalen. 1992, Vol 293, Num 2, pp 371-384, issn 0025-5831Article

On the closure properties of linear conjunctive languagesOKHOTIN, Alexander.Theoretical computer science. 2003, Vol 299, Num 1-3, pp 663-685, issn 0304-3975, 23 p.Article

Nonacceptability criteria and closure properties for the class of languages accepted by binary systolic tree automataFACHINI, E; SCHETTINI, A. M; RESTA, G et al.Theoretical computer science. 1991, Vol 83, Num 2, pp 249-260, issn 0304-3975, 12 p.Article

Oscillatory solutions to transport equationsCRIPPA, Gianluca; DE LELLIS, Camillo.Indiana University mathematics journal. 2006, Vol 55, Num 1, pp 1-13, issn 0022-2518, 13 p.Article

Low complexity classes of multidimensional cellular automataTERRIER, Véronique.Theoretical computer science. 2006, Vol 369, Num 1-3, pp 142-156, issn 0304-3975, 15 p.Article

Extended admissible functions and Gaussian limiting distributionsDRMOTA, Michael; GITTENBERGER, Bernhard; KLAUSNER, Thomas et al.Mathematics of computation. 2005, Vol 74, Num 252, pp 1953-1966, issn 0025-5718, 14 p.Article

On the closure of certain function classes under integer division by polynomially-bounded functionsGUPTA, S.Information processing letters. 1992, Vol 44, Num 4, pp 205-210, issn 0020-0190Article

Well-structured languagesGEERAERTS, Gilles; RASKIN, Jean-Francois; VAN BEGIN, Laurent et al.Acta informatica. 2007, Vol 44, Num 3-4, pp 249-288, issn 0001-5903, 40 p.Article

Block insertion and deletion on trajectoriesBO CUI; KARI, Lila; SEKI, Shinnosuke et al.Theoretical computer science. 2011, Vol 412, Num 8-10, pp 714-728, issn 0304-3975, 15 p.Article

  • Page / 3