Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("CONTEXT")

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 23818

  • Page / 953

Export

Selection :

  • and

ON THE GENERATIVE CAPACITY OF SOME CLASSES OF GRAMMARS WITH REGULATED REWRITINGPAUN G.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 407-414; BIBL. 9 REF.Conference Paper

BOUNDED NESTING IN MACRO GRAMMARSENGELFRIET J; SLUTZKI G.1979; INFIRM. AND CONTROL; USA; DA. 1979; VOL. 42; NO 2; PP. 157-193; BIBL. 1 P.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

LE REPRESENTAMEN ET L'OBJET DANS LA SEMIOSIS DE CHARLES S. PEIRCEDELEDALLE G.1981; SEMIOTICA; ISSN 0037-1998; NLD; DA. 1981; VOL. 33; NO 3-4; PP. 195-200; BIBL. 6 REF.Article

A SCALE OF CONTEXT SENSITIVE LANGUAGES: APPLICATIONS TO NATURAL LANGUAGEPLATEK M; SGALL P.1978; INFORM. AND CONTROL; USA; DA. 1978; VOL. 38; NO 1; PP. 1-20; BIBL. 20 REF.Article

INDEXICAL CONTEXTSSVENONIUS E.1982; UNIVERSAL CLASSIFICATION 1 - SUBJECT ANALYSIS AND ORDERING SYSTEMS. INTERNATIONAL STUDY CONFERENCE ON CLASSIFICATION RESEARCH. 4. GESELLSCHAFT FUER KLASSIFIKATION. ANNUAL CONFERENCE. 6/1982-06-28/AUGSBURG; DEU; FRANKFURT: INDEKS VERLAG; DA. 1982; PP. 125-138; BIBL. 14 REF.Conference Paper

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

ON THE POWER OF CHAIN RULES IN CONTEXT FREE GRAMMARSBLUM N.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 17; NO 4; PP. 425-433; BIBL. 2 REF.Article

A GENERAL CLASS OF NONCONTEXT FREE GRAMMARS GENERATING CONTEXT FREE LANGUAGEAGGARWAL SK; HEINEN JA.1979; INFORM. AND CONTROL; USA; DA. 1979; VOL. 43; NO 2; PP. 187-194; BIBL. 8 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

AN ALGEBRAIC TECHNIQUE FOR CONTEXT-SENSITIVE PARSING.CANNON RL JR.1976; INTERNATION. J. COMPUTER INFORM. SCI.; U.S.A.; DA. 1976; VOL. 5; NO 3; PP. 257-276; BIBL. 16 REF.Article

CONTEXT-FREE GRAMMARS WITH SELECTIVE REWRITINGROZENBERG G; WOOD D.1980; ACTA INFORMAT.; DEU; DA. 1980; VOL. 13; NO 3; PP. 257-268; BIBL. 12 REF.Article

HEXAGONAL ARRAY GRAMMARSSUBRAMANIAN KG.1979; COMPUTER GRAPH IMAGE PROCESSG; USA; DA. 1979; VOL. 10; NO 4; PP. 388-394; BIBL. 3 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

THE STRUCTURE OF CONTEXT-FREE GRAMMATICAL FAMILIES.CREMERS A; GINSBURG S; SPANIER EH et al.1977; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1977; VOL. 15; NO 3; PP. 262-279; BIBL. 7 REF.Article

FORMES DE LANGAGES ET DE GRAMMAIRESAUTEBERT JM; BEAUQUIER J; BOASSON L et al.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 17; NO 2; PP. 193-213; ABS. ENG; BIBL. 17 REF.Article

LANGUAGE OPERATORS RELATED TO INITPRODINGER H; URBANEK FJ.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 8; NO 2; PP. 161-175; BIBL. 1 REF.Article

ERROR-CORRECTING PARSERS FOR FORMAL LANGUAGES = ANALYSEURS SYNTAXIQUES CORRECTEUR D'ERREURS POUR LANGAGES FORMELSTANAKA E; FU KS.1978; I.E.E.E. TRANS. COMPUTERS; USA; DA. 1978; VOL. 27; NO 7; PP. 605-616; BIBL. 18 REF.Article

ON SOME VARIANTS OF CONTEXTUAL LANGUAGES.NOVOTNY M.1976; REV. ROUMAINE MATH. PURES APPL.; ROUMAN.; DA. 1976; VOL. 21; NO 8; PP. 1053-1062; BIBL. 1 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

CONTEXT-FREE LANGUAGES OF FINITE WORDS AS LEAST FIXPOINTSPOIGNE A.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 301-320; BIBL. 7 REF.Conference Paper

ON THE REGULARITY PROBLEM OF SF-LANGUAGES GENERATED BY MINIMAL LINEAR GRAMMARSLINNA M.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 244-249; BIBL. 4 REF.Conference Paper

THE DECIDABILITY OF EQUIVALENCE FOR A FAMILY OF LINEAR GRAMMARSYEHUDAI A.1980; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1980; VOL. 47; NO 2; PP. 122-136; BIBL. 25 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

  • Page / 953