Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:(%22Context sensitive language%22)

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 226585

  • Page / 9064
Export

Selection :

  • and

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

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

Building context-sensitive parsers from CF grammars with regular control languageBRAVO, César; NETO, Joao José.Lecture notes in computer science. 2003, pp 306-308, issn 0302-9743, isbn 3-540-40561-5, 3 p.Conference Paper

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

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

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

Church-Rosser Languages vs. UCFLJURDZINSKI, Tomasz; LORYS, Krzysztof.Lecture notes in computer science. 2002, pp 147-158, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

The context-splittable normal form for Church-Rosser language systemsWOINOWSKI, Jens R.Information and computation (Print). 2003, Vol 183, Num 2, pp 245-274, issn 0890-5401, 30 p.Conference Paper

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

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

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 algebras of languagesMARINI, Claudio; SIMI, Giulia; SORBI, Andrea et al.Theoretical computer science. 2011, Vol 412, Num 46, pp 6531-6536, issn 0304-3975, 6 p.Article

DESCRIPTION FORMELLE DES CONDITIONS CONTEXTUELLES DES LANGAGES DE PROGRAMMATIONNATANSON LG.1977; PROGRAMMIROVANIE; S.S.S.R.; DA. 1977; NO 4; PP. 14-23; BIBL. 12 REF.Article

A note on 4Q196 (Paptob ARA) and Tobit I 22WISE, M. O.Vetus Testamentum. 1993, Vol 43, Num 4, pp 566-570, issn 0042-4935Article

Shuffle littéral : étude formelle et applications = Literal suffle: formal study and applicationsBERARD, Béatrice.1985, [156] pThesis

ELEMENTARY BOUNDED LANGUAGESISTRAIL S.1978; INFORM. AND CONTROL.; USA; DA. 1978; VOL. 39; NO 2; PP. 177-191; BIBL. 6 REF.Article

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

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

Inferring Grammars for Mildly Context Sensitive Languages in Polynomial-TimeOATES, Tim; ARMSTRONG, Tom; BECERRA BONACHE, Leonor et al.Lecture notes in computer science. 2006, pp 137-147, issn 0302-9743, isbn 3-540-45264-8, 1Vol, 11 p.Conference Paper

THE CONTEXTSENSITIVY BOUNDS OF CONTEXTSENSITIVE GRAMMARS AND LANGUAGES.BRANDENBURG FJ.1977; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1977; VOL. 52; PP. 120-134; BIBL. 12 REF.; (AUTOM. LANG. PROGRAM. COLLOQ. 4; TURKU; 1977)Conference Paper

Context-sensitive string languages and recognizable picture languagesLATTEUX, M; SIMPLOT, D.Information and computation (Print). 1997, Vol 138, Num 2, pp 160-169, issn 0890-5401Article

LEFT TRANSFORMATION LANGUAGESTANAKA H.1981; PUBL. RES. INST. MATH. SCI.; JPN; DA. 1981; VOL. 17; NO 1; PP. 267-296; BIBL. 3 REF.Article

ON THE LANGUAGES GENERATED BY CONTEXT-SENSITIVE FUZZY GRAMMARSBUCURESCU I; PASCU A.1981; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1981; VOL. 9; NO 4; PP. 277-285; BIBL. 6 REF.Article

  • Page / 9064