Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("CONTEXT SENSITIVE LANGUAGE")

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 145

  • Page / 6
Export

Selection :

  • and

ON THE DIAGONALS OF N-REGULAR RELATIONS.STARKE PH.1976; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1976; VOL. 12; NO 6; PP. 281-288; ABS. ALLEM. RUSSE; BIBL. 6 REF.Article

CONTEXT SENSITIVE TABLE LINDENMAYER LANGUAGES AND A RELATION TO THE LBA PROBLEM.VITANYI PMB.1977; INFORM. AND CONTROL; U.S.A.; DA. 1977; VOL. 33; NO 3; PP. 217-226; BIBL. 12 REF.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

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

CONTEXT-DEPENDENT TREE AUTOMATAPYSTER A.1978; INFORM. AND CONTROL; USA; DA. 1978; VOL. 38; NO 1; PP. 81-102; BIBL. 16 REF.Article

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

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

COMPUTING GRAMMARS AND CONTEXT-SENSITIVE LANGUAGES.SIMOVICI DA; ISTRAIL S.1978; R.A.I.R.O., INFORMAT. THEOR.; FR.; DA. 1978; VOL. 12; NO 1; PP. 33-48; BIBL. 4 REF.Article

GENERALIZED SYNTAX DIRECTED TRANSLATION, TREE TRANSDUCERS, AND LINEAR SPACE.BAKER BS.1978; S.I.A.M.J. COMPUTG; USA; DA. 1978; VOL. 7; NO 3; PP. 376-391; BIBL. 13 REF.Article

A FINITE STATE PROBABILISTIC AUTOMATON THAT ACCEPTS A CONTEXT SENSITIVE LANGUAGE THAT IS NOT CONTEXT FREE.KUO AN CHEN; MING KUEI HU.1977; INFORM. AND CONTROL; U.S.A.; DA. 1977; VOL. 35; NO 3; PP. 196-208; BIBL. 7 REF.Article

INTERDEPENDENT TRANSLATION SCHEMESGEORGEFF MP.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 2; PP. 198-219; BIBL. 17 REF.Article

LANGUAGES SIMULTANEOUSLY COMPLETE FOR ONE-WAY AND TWO-WAY LOGTAPE AUTOMATAHARTMANIS J; MAHANEY S.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 2; PP. 383-390; BIBL. 11 REF.Article

PURE GRAMMARS AND PURE LANGUAGESGABRIELIAN A.1981; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1981; VOL. 9; NO 1; PP. 3-16; BIBL. 20 REF.Article

THE FAMILY OF LANGUAGES SATISFYING BAR-HILLEL'S LEMMAHORVATH S.1978; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1978; VOL. 12; NO 3; PP. 193-199; BIBL. 14 REF.Article

ITERATED A-NGSM MAPS AND GAMMA SYSTEMS.WOOD D.1976; INFORM. AND CONTROL; U.S.A.; DA. 1976; VOL. 32; NO 1; PP. 1-26; BIBL. 17 REF.Article

INFERENCE OF A CLASS OF CFPG BY MEANS OF SEMANTIC RULESTAI JW; FU KS.1982; INT. J. COMPUT. INF. SCI.; ISSN 0091-7036; USA; DA. 1982; VOL. 11; NO 1; PP. 1-23; BIBL. 14 REF.Article

CHOMSKY-SCHUETZENBERGER REPRESENTATIONS FOR FAMILIES OF LANGUAGES AND GRAMMATICAL TYPESISTRAIL S.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 333-347; BIBL. 18 REF.Conference Paper

REWRITING SYSTEMS WITH LIMITED DISTANCE PERMITTING CONTEXTSOLMS SH.1980; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1980; VOL. 8; NO 3; PP. 223-231; BIBL. 3 REF.Article

FAST RECOGNITION OF CONTEXT-SENSITIVE STRUCTURESBARTH G.1979; COMPUTING; AUT; DA. 1979; VOL. 22; NO 3; PP. 243-256; ABS. GER; BIBL. 10 REF.Article

ON ISOMORPHISMS AND DENSITY OF NP AND OTHER COMPLETE SETS.BERMAN L; HARTMANIS J.1977; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 2; PP. 305-322; BIBL. 17 REF.Article

PROPRIETES COMPLEXES DES LANGAGES CSKANOVICH MI.1977; DOKL. AKAD. NAUK S.S.S.R.; S.S.S.R.; DA. 1977; VOL. 233; NO 3; PP. 289-292; BIBL. 8 REF.Article

PROPRIETES D'UNIVERSALITE DE QUELQUES CLASSES DE LANGAGESBURGINA ES.1976; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1976; NO 3; PP. 82-88; BIBL. 9 REF.Article

CONTEXT SENSITIVE EDITING AS AN APPROACH TO INCREMENTAL COMPILATIONATKINSON LV; MCGREGOR JJ; NORTH SD et al.1981; COMPUT. J.; ISSN 0010-4620; GBR; DA. 1981; VOL. 24; NO 3; PP. 222-229; BIBL. 8 REF.Article

AUTOMATES A FILEVAUQUELIN B; FRANCHI ZANNETTACCI P.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 11; NO 2; PP. 221-225; BIBL. 6 REF.Article

THEORETISCHE UNTERSUCHUNGEN ZUR BEHANDLUNG VON KONTEXTSENSITIVITAETEN = RECHERCHES THEORIQUES CONCERNANT LE TRAITEMENT DES SENSITIVITES DE CONTEXTEBACHMANN P.1980; WISSENSCHAFTL. Z. TECH. UNIV. DRESD.; ISSN 0043-6925; DDR; DA. 1980; VOL. 29; NO 2; PP. 339-341; BIBL. 11 REF.Article

  • Page / 6