Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("NORMAL FORM")

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 2018

  • Page / 81
Export

Selection :

  • and

EINE REPRAESENTATIVE AUSWAHL VON KNOTENMATRIZEN ZU KLASSEN ISOMORPHER GRAPHEN = UNE SELECTION REPRESENTATIVE DES MATRICES DECRIVANT DES CLASSES DE GRAPHES ISOMORPHESREUSS WJ.1982; COMPUTING; ISSN 0010-485X; AUT; DA. 1982; VOL. 28; NO 3; PP. 247-255; ABS. ENG; BIBL. 4 REF.Article

INVERTIBLE TERMS IN THE LAMBDA CALCULUSBERGSTRA J; KLOP JW.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 11; NO 1; PP. 19-37; BIBL. 13 REF.Article

MINIMISIERUNG SCHALTALGEBRAISCHER AUSDRUECKE DURCH AUSWAHL VON PRIMKONJUNKTIONEN OHNE RUECKGRIFF AUF DIE KANONISCHE ALTERNATIVE NORMALFORM = MINIMISATION D'EXPRESSIONS PROPOSITIONNELLES ALGEBRIQUES PAR LE CHOIX D'UNE CONJONCTION PRIMAIRE SANS RECOURS A LA FORME NORMALE CANONIQUE ALTERNATIVEBARTHEL D.1979; ELEKTRON. INFORM.-VERARBEIT KYBERN.; DDR; DA. 1979; VOL. 15; NO 4; PP. 213-220; ABS. ENG/RUS; BIBL. 4 REF.Article

Normal forms for fuzzy logic functions and their approximation abilityPERFILIEVA, Irina.Fuzzy sets and systems. 2001, Vol 124, Num 3, pp 371-384, issn 0165-0114Article

COMPARAISON DES FONCTIONS BOOLEENNES SUIVANT LES FORMES NORMALES IMPARFAITESPOVAROV GN.1982; IZV. AKAD. NAUK SSSR, TEH. KIBERN.; ISSN 0002-3388; SUN; DA. 1982; NO 1; PP. 209-210; BIBL. 4 REF.Article

MINIMIZATION OF DISJUNCTIVE NORMAL FORMS OF FUZZY LOGIC FUNCTIONSBHAT KVS.1981; J. FRANKLIN INST.; ISSN 0016-0032; USA; DA. 1981; VOL. 311; NO 3; PP. 171-185; BIBL. 16 REF.Article

CIRCUITS SEQUENTIELS AUTONOMES ANTITONIQUES. II. CYCLOGRAMMES ET LEURS PROPRIETESSTARODUBTSEV NA.1981; IZV. AKAD. NAUK SSSR, TEH. KIBERN.; ISSN 0002-3388; SUN; DA. 1981; NO 5; PP. 87-93; BIBL. 4 REF.Article

A NORMAL FORM THEOREM FOR LABEL GRAMMARSJANTZEN M; OPP M.1981; MATH. SYST. THEORY; ISSN 0025-5661; DEU; DA. 1981; VOL. 14; NO 4; PP. 289-303; BIBL. 12 REF.Article

REDUCTION D'UN SYSTEME D'EQUATIONS DIFFERENTIELLES A LA FORME NORMALE PAR UNE TRANSFORMATION ANALYTIQUEZINCHENKO IL.1978; VEST. LENINGRAD. UNIV.; SUN; DA. 1978; NO 13; PP. 136-138; ABS. ENG; BIBL. 2 REF.Article

SYNCHRONIZED EOL FORMS UNDER UNIFORM INTERPRETATIONMAURER HA; SALOMAA A; WOOD D et al.1981; R.A.I.R.O., INFORM. THEOR.; ISSN 0399-0540; FRA; DA. 1981; VOL. 15; NO 4; PP. 337-353; ABS. FRE; BIBL. 11 REF.Article

UNIQUE NORMAL FORMS IN TERM REWRITING SYSTEMS WITH REPEATED VARIABLESCHEN P.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/WILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 7-18; BIBL. 5 REF.Conference Paper

ALGORITHMEN UND PROGRAMME ZUR BEHANDLUNG BINAERER GLEICHUNGEN = ALGORITHMES ET PROGRAMMES POUR LE TRAITEMENT D'EQUATIONS METTANT EN OEUVRE DES FONCTIONS LOGIQUESPOSTHOFF C; STEINBACH B.1980; NACHR.-TECH., ELEKTRON.; DDR; DA. 1980; VOL. 30; NO 3; PP. 92-96; BIBL. 9 REF.Article

APPROXIMATION DE QUELQUES CLASSES DU CALCUL CLASSIQUE DES PREDICATS PAR DES CLASSES RESOLUBLES. INORGELA S.1980; LITOV. MAT. SBOR.; SUN; DA. 1980; VOL. 20; NO 1; PP. 135-143; ABS. LIT/ENG; BIBL. 6 REF.Article

ON COMPUTING THE SMITH NORMAL FORM OF AN INTEGER MATRIXRAYWARD SMITH VJ.1979; A.C.M. TRANS. MATH. SOFTWARE; USA; DA. 1979; VOL. 5; NO 7; PP. 451-456; BIBL. 12 REF.Article

A SUPERNORMAL-FORM THEOREM FOR CONTEXT-FREE GRAMMARSMAURER HH; SALOMAA A; WOOD D et al.1983; JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY; ISSN 0004-5411; USA; DA. 1983; VOL. 30; NO 1; PP. 95-102; BIBL. 12 REF.Article

INFLUENCE DE LA DEPENDANCE FONCTIONNELLE DES ENSEMBLES DE CODES DANS L'OPTIMISATION DE LA STRUCTURE LOGIQUE A DEUX NIVEAUX D'UN AUTOMATELEMBERSKIJ IG.1980; AVTOMAT. VYCHISLIT. TEKH.; SUN; DA. 1980; NO 4; PP. 42-49; BIBL. 1 REF.Article

LES DIFFERENTES NOTIONS DE MINIMALITE DES FORMES NORMALES DISJONCTIVESVEBER K.1979; PROBL. KIBERN.; SUN; DA. 1979; NO 36; PP. 129-158; BIBL. 10 REF.Article

ALGORITHMS FOR FINDING CHOMSKY AND GREIBACH NORMAL FORMS FOR A FUZZY CONTEXT-FREE GRAMMAR USING AN ALGEBRAIC APPROACHLEE ET.1983; KYBERNETES; ISSN 0368-492X; GBR; DA. 1983; VOL. 12; NO 2; PP. 125-134; BIBL. 16 REF.Article

COMPLETENESS OF CONTEXT-FREE GRAMMAR FORMSMAURER HA; SALOMAA A; WOOD D et al.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 23; NO 1; PP. 1-10; BIBL. 14 REF.Article

DEMONSTRATION ELEMENTAIRE ET APPLICATIONS D'UN THEOREME DE F. TAKENSSADOVSKIJ AP.1980; DIFFER. URAVN. (MINSK, 1965); ISSN 0374-0641; BYS; DA. 1980; VOL. 16; NO 12; PP. 2284-2287; BIBL. 11 REF.Article

COMPLEXITY OF PARTIAL SATISFACTIONLIEBERHERR K; SPECKER E.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 132-139; BIBL. 12 REF.Conference Paper

FROM LEFT-REGULAR TO GREIBACH NORMAL FORM GRAMMARSNIJHOLT A.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 1; PP. 51-55; BIBL. 14 REF.Article

THE COMPLEXITY OF RECOGNIZING 3NF RELATION SCHEMESJOU JH; FISCHER PC.1982; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 4; PP. 187-190; BIBL. 10 REF.Article

CORRIGENDUM TO "THE COMPLEMENT OF A FINITE INDEX MATRIX LANGUAGE IS CONTEXT SENSITIVE"PAUN G.1981; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 51; NO 2; PP. 188-192; BIBL. 3 REF.Article

SUB-REGULAR GRAMMAR FORMSOTTMAN T; SALOMAA A; WOOD D et al.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 4; PP. 184-187; BIBL. 16 REF.Article

  • Page / 81