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

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

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

A MULTIVARIABLE NORMAL-FORM FOR MODEL REDUCTION OF DISCRETE-TIME SYSTEMSBADREDDIN E; MANSOUR M.1983; SYSTEMS AND CONTROL LETTERS; ISSN 509167; NLD; DA. 1983; VOL. 2; NO 5; PP. 271-285; BIBL. 11 REF.Article

A SIMPLE GUIDE TO FIVE NORMAL FORMS IN RELATIONAL DATABASE THEORYKENT W.1983; COMMUNICATIONS OF THE A.C.M.; ISSN 0001-0782; USA; DA. 1983; VOL. 26; NO 2; PP. 120-125; BIBL. 8 REF.Article

RELATIONS BINAIRES COORDONNEES DANS L'ESPACE DES CRITERES. IIVINOGRADSKAYA TM; RUBCHINSKIJ AA.1981; AVTOM. TELEMEH.; ISSN 0005-2310; SUN; DA. 1981; NO 4; PP. 147-155; ABS. ENG; BIBL. 3 REF.Article

A REMARK ON NORMAL FORMS OF MATRICESDLAB V; RINGEL CM.1980; LINEAR ALGEBRA APPL.; USA; DA. 1980-04; VOL. 30; PP. 109-114; BIBL. 5 REF.Article

THE NONEXISTENCE OF SOME COVERING CONTEXT-FREE GRAMMARSUKKONEN E.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 4; PP. 187-192; BIBL. 6 REF.Article

CALCULS FINIS ET INFINIS SUR LES TERMES COMBINATOIRESCANAL R; VIGNOLLE J.1979; LAMBDA CALCUL ET SEMANTIQUE FORMELLE DES LANGAGES DE PROGRAMMATION. ECOLE DE PRINTEMPS D'INFORMATIQUE THEORIQUE. 6/1978/LA CHATRE; FRA; PARIS: LABORATOIRE D'INFORMATIQUE THEORIQUE ET PROGRAMMATION/PARIS: ECOLE NATIONALE SUPERIEURE DE TECHNIQUES AVANCEES; DA. 1979; PP. 109-130; BIBL. 3 P.Conference Paper

A note on relation schemes which are in 3NF but not in BCNFVINCENT, M. W; SRINIVASAN, B.Information processing letters. 1993, Vol 48, Num 6, pp 281-283, issn 0020-0190Article

Construction of disjunctive normal forms in problems of pattern recognition with binary informationD'YAKONOV, A. G.Doklady. Mathematics. 2002, Vol 65, Num 2, pp 321-323, issn 1064-5624Article

Some observations on the minimal Armstrong relations for normalized relation schemesDEMETROVICS, J; VI DUC THI.Computers and artificial intelligence. 1995, Vol 14, Num 5, pp 455-467, issn 0232-0274Article

Maximum renamable Horn sub-CNFs : The Satisfiability ProblemBOROS, E.Discrete applied mathematics. 1999, Vol 96-97, pp 29-40, issn 0166-218XArticle