Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Lenguaje CS")

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 135

  • Page / 6
Export

Selection :

  • and

Nondeterministic space is closed under complementationIMMERMAN, N.SIAM journal on computing (Print). 1988, Vol 17, Num 5, pp 935-938, issn 0097-5397Article

Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languagesAYERS, K.Theoretical computer science. 1985, Vol 40, Num 2-3, pp 163-174, issn 0304-3975Article

Rational graphs trace context-sensitive languagesMORVAN, Christophe; STIRLING, Colin.Lecture notes in computer science. 2001, pp 548-559, issn 0302-9743, isbn 3-540-42496-2Conference Paper

Termination of rewriting with strategy annotationsLUCAS, Salvador.Lecture notes in computer science. 2001, pp 669-684, issn 0302-9743, isbn 3-540-42957-3Conference Paper

The learning and emergence of mildly context sensitive languagesSTABLER, Edward P; COLLIER, Travis C; KOBELE, Gregory M et al.Lecture notes in computer science. 2003, pp 525-534, issn 0302-9743, isbn 3-540-20057-6, 10 p.Conference Paper

The growing context-sensitive languages are the acyclic context-sensitive languagesNIEMANN, Gundula; WOINOWSKI, Jens R.Lecture notes in computer science. 2002, pp 197-205, issn 0302-9743, isbn 3-540-43453-4Conference Paper

Yield-languages recognized by alternative tree recognizersSALOMAA, K.Informatique théorique et applications (Imprimé). 1988, Vol 22, Num 3, pp 319-339, issn 0988-3754Article

Evolution and observation : A non-standard way to accept formal languagesCAVALIERE, Matteo; LEUPOLD, Peter.Lecture notes in computer science. 2005, pp 153-163, issn 0302-9743, isbn 3-540-25261-4, 11 p.Conference Paper

On the complexity of 2-monotone restarting automataJURDZINSKI, T; OTTO, F; MRAZ, F et al.Lecture notes in computer science. 2004, pp 237-248, issn 0302-9743, isbn 3-540-24014-4, 12 p.Conference Paper

Termination of (canonical) context-sensitive rewritingLUCAS, Salvador.Lecture notes in computer science. 2002, pp 296-310, issn 0302-9743, isbn 3-540-43916-1, 15 p.Conference Paper

Iterated length-preserving rational transductionsLATTEUX, M; SIMPLOT, D; TERLUTTE, A et al.Lecture notes in computer science. 1998, pp 286-295, issn 0302-9743, isbn 3-540-64827-5Conference Paper

Scattered versus context-sensitive rewritingGONCZAROWSKI, J; WARMUTH, M. K.Acta informatica. 1989, Vol 27, Num 1, pp 81-95, issn 0001-5903Article

A note on exponential density of etol languagesMEDUNA, A.Kybernetika. 1986, Vol 22, Num 6, pp 514-518, issn 0023-5954Article

Expression reduction systems and extensions : An overviewGLAUERT, John; KESNER, Delia; KHASIDASHVILI, Zurab et al.Processes, terms and cycles : steps on the road to infinity (essays dedicated to Jan Willem Klop on the occasion of his 60th birthday). Lecture notes in computer science. 2005, pp 496-553, issn 0302-9743, isbn 3-540-30911-X, 1Vol, 58 p.Book Chapter

Improving the precision of equality-based dataflow analysesRUF, Erik.Lecture notes in computer science. 2002, pp 247-262, issn 0302-9743, isbn 3-540-44235-9, 16 p.Conference Paper

Some Petri net languages and codesITO, Masami; KUNIMOCH, Yoshiyuki.Lecture notes in computer science. 2002, pp 69-80, issn 0302-9743, isbn 3-540-43453-4Conference Paper

On Inherently context-sensitivity languages―An application of complexity coresDIEKERT, V; BOOK, R. V.Information processing letters. 1991, Vol 40, Num 1, pp 21-23, issn 0020-0190Article

Regeneration in IL systemsKELEMENOVA, A.Discrete applied mathematics. 1988, Vol 22, Num 1, pp 81-86, issn 0166-218XArticle

Language-theoretic complexity of disjunctive sequencesCALUDE, C; YU, S.Discrete applied mathematics. 1997, Vol 80, Num 2-3, pp 203-209, issn 0166-218XArticle

Formal languages defined by the underlying structure of their wordsRESSAYRE, J. P.The Journal of symbolic logic. 1988, Vol 53, Num 4, pp 1009-1026, issn 0022-4812Article

RTA 2002 : rewriting techniques and applications (Copenhagen, 22-24 July 2002)Tison, Sophie.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-43916-1, XI, 385 p, isbn 3-540-43916-1Conference Proceedings

Context sensitivity in role-based access controlKUMAR, Arun; KARNIK, Neeran; CHAFLE, Girish et al.Operating systems review. 2002, Vol 36, Num 3, pp 53-66, issn 0163-5980Article

The root of a language and its complexityLISCHKE, Gerhard.Lecture notes in computer science. 2002, pp 272-280, issn 0302-9743, isbn 3-540-43453-4Conference Paper

The method of forced enumeration for nondeterministic automataSZELEPCSENYI, R.Acta informatica. 1988, Vol 26, Num 3, pp 279-284, issn 0001-5903Article

On the impossibility of the homomorphic characterization of context-sensitive languagesOKAWA, S; HIROSE, S; YONEDA, M et al.Theoretical computer science. 1986, Vol 44, Num 2, pp 225-228, issn 0304-3975Article

  • Page / 6