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

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

ELEMENTARY BOUNDED LANGUAGESISTRAIL S.1978; INFORM. AND CONTROL.; USA; DA. 1978; VOL. 39; NO 2; PP. 177-191; BIBL. 6 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

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

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 SIMPLE REPRESENTATIONS OF LANGUAGE FAMILIESCULIK K II; MAURER HA.1979; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1979; VOL. 13; NO 3; PP. 241-250; ABS. FRE; BIBL. 14 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

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

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

ON THE GENERATIVE CAPACITY OF CONTEXTUAL SCHEMATA WITH SYNTACTICAL-INVARIANT CHOICENGUYEN XUAN MY; PAUN G.1982; ELEKTRON. INFORMATIONSVERARB. KYBERN.; ISSN 0013-5712; DDR; DA. 1982; VOL. 18; NO 1-2; PP. 57-65; ABS. FRE/GER; BIBL. 14 REF.Article

INTERACTIVE L SYSTEMS WITH ALMOST INTERACTIONLESS BEHAVIOURCULIK K II; KARHUMAKI J.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 246-257; BIBL. 8 REF.Conference Paper

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

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

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

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

ON LABELLED GRAPH GRAMMARS.LEVY LS; KANG YUEH.1978; COMPUTING; AUSTR.; DA. 1978; VOL. 20; NO 12; PP. 109-125; ABS. ALLEM.; BIBL. 10 REF.Article

CONTRAINTES D'INTEGRITE DANS LE MODELE LINGUISTIQUE D'UNE BASE DE DONNEESKOPEC B; SUBIETA K.1977; PRACE I.P.I. P.A.N.; POLSKA; DA. 1977; NO 303; PP. 1-28; ABS. ANGL. RUSSE; BIBL. 8 REF.Article

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

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

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

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

SPACE-BOUNDED COMPLEXITY CLASSES AND ITERATED DETERMINISTIC SUBSTITUTIONASVELD PRJ.1980; INFORM. AND CONTROL; USA; DA. 1980; VOL. 44; NO 3; PP. 282-299; BIBL. 2 P.Article

BOUNDED AFLS.GOLDSTINE J.1976; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1976; VOL. 12; NO 3; PP. 399-419; BIBL. 16 REF.Article

LOCAL CONTRAINTS IN PROGRAMMING LANGUAGES. I: SYNTAXJOSHI AK; LEVY LS; YUEH K et al.1980; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1980; VOL. 12; NO 3; PP. 265-290; BIBL. 15 REF.Article

  • Page / 9064