DETERMINISTIC ONE-COUNTER AUTOMATA.VALIANI LG; PATERSON MS.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 10; NO 3; PP. 340-350; BIBL. 6 REF.Article

ON THE EQUIVALENCE OF SCHEMES = SUR L'EQUIVALENCE DES PROCEDURESGARLAND SJ; LUCKHAM DC.sdIN: 4TH ANNU. ACM SYMP. THEORY COMPUT. DENVER, COLO, 1972. PROC.; S.L.; DA. S.D.; PP. 65-72; BIBL. 6 REF.Conference Paper

A DIRECT BRANCHING ALGORITHM FOR CHECKING EQUIVALENCE OF STRICT DETERMINISTIC VS. LL(K) GRAMMARSTOMITA E.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 2; PP. 129-154; BIBL. 23 REF.Article

ON THE COMPLEXITY OF SIMPLE ARITHMETIC EXPRESSIONSIBARRA OH; LEININGER BS; MORAN S et al.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 19; NO 1; PP. 17-28; BIBL. 9 REF.Article

THE EQUIVALENCE PROBLEM FOR SOME NON-REAL-TIME DETERMINISTIC PUSHDOWN AUTOMATAUKKONEN E.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 4; PP. 1166-1181; BIBL. 17 REF.Article

ON FORM-EQUIVALENCE OF DETERMINISTIC PURE GRAMMAR FORMSHAGAUER J.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 18; NO 1; PP. 69-87; BIBL. 16 REF.Article

ON THE COMPLEXITY OF SIMPLIFYING QUADRATIC FORMSSNIR M.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 5; PP. 217-220; BIBL. 8 REF.Article

THE COMPLEXITY OF DECISION PROBLEMS FOR FINITE-TURN MULTICOUNTER MACHINESGURARI EM; IBARRA OH.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 495-505; BIBL. 18 REF.Conference Paper

ON MULTITAPE AUTOMATAYAMASAKI H.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 533-541; BIBL. 5 REF.Conference Paper

REMARKS ON THE COMPLEXITY OF AN INVARIANT OF CONTEXT-FREE GRAMMARSTHIET DUNG HUYNH.1982; ACTA INF.; ISSN 0001-5903; DEU; DA. 1982; VOL. 17; NO 1; PP. 89-99; BIBL. 8 REF.Article

VOMPLETENESS OF EOL FORMS IS DECIDABLEROZENBERG G; VERRAEDT R.1982; ACTA INF.; ISSN 0001-5903; DEU; DA. 1982; VOL. 17; NO 1; PP. 69-87; BIBL. 15 REF.Article

THE EQUIVALENCE PROBLEM FOR PARTIALLY AUTONOMOUS FINITE AUTOMATAIWAMA K; KAMBAYASHI Y; YAJIMA S et al.1980; SYST. COMPUT. CONTROLS; ISSN 0096-8765; USA; DA. 1980 PUBL. 1982; VOL. 11; NO 2; PP. 27-35; BIBL. 14 REF.Article

A BRANCHING ALGORITHM FOR DECIDING EQUIVALENCE OF DETERMINISTIC PUSHDOWN AUTOMATA (IN DO:RO)TOMITA E.1978; SYST., COMPUT. CONTROLS; ISSN 0096-8765; USA; DA. 1978 PUBL. 1980; VOL. 9; NO 5; PP. 63-69; BIBL. 10 REF.Article

SOME SIMPLIFIED UNDECIDABLE AND NP-HARD PROBLEMS FOR SIMPLE PROGRAMSGURANI EM; IBARRA OH.1982; THEOR. COMPUT. SCI.; NLD; DA. 1982; VOL. 17; NO 1; PP. 55-73; BIBL. 13 REF.Article

A POLYNOMIAL TIME ALGORITHM FOR DECIDING THE EQUIVALENCE PROBLEM FOR 2-TAPE DETERMINISTIC FINITE STATE ACCEPTORSFRIEDMAN EP; GREIBACH SA.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 1; PP. 166-183; BIBL. 9 REF.Article

THE W-SEQUENCE EQUIVALENCE PROBLEM FOR DOC SYSTEMS IS DECIDABLECULIK K II; HARJU T.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 1-6; BIBL. 15 REF.Conference Paper

EVERY TWO EQUIVALENT DOL SYSTEMS HAVE A REGULAR TRUE ENVELOPEEHRENFEUCHT A; ROZENBERG G.1980; THEOR. COMPUTER SCI.; NLD; DA. 1980; VOL. 10; NO 1; PP. 45-52; BIBL. 3 REF.Article

SUBRECURSIVE PROGRAM SCHEMATA. I. UNDECIDABLE EQUIVALENCE PROBLEMS. II. DECIDABLE EQUIVALENCE PROBLEMS = SCHEMAS DE PROGRAMME SOUS RECURSIF. I. PROBLEMES D'EQUIVALENCE INDECIDABLES. II. PROBLEMES D'EQUIVALENCE DECIDABLES.CONSTABLE RL; MUCHNICK SS.sdIN: 4 TH ANNU. ACM SYMP. THEORY COMPUT. DENVER, COLO, 1972. PROC.; S.L.; DA. S.D.; PP. 1-17; BIBL. 1 P.Conference Paper

FINITE STATE RELATIONAL PROGRAMSSLUTZKI G.1983; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1983; VOL. 18; NO 4; PP. 393-409; BIBL. 6 REF.Article

ON THE EQUIVALENCE AND CONTAINMENT PROBLEMS FOR UNAMBIGUOUS REGULAR EXPRESSIONS, GRAMMARS, AND AUTOMATASTEARNS RE; HUNT HB.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 74-81; BIBL. 11 REF.Conference Paper

THE COMPLEXITY OF THE EQUIVALENCE PROBLEM FOR TWO CHARACTERIZATIONS OF PRESBURGER SETSGURARI EM; IBARRA OH.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 13; NO 3; PP. 295-314; BIBL. 14 REF.Article

THE EQUIVALENCE PROBLEM FOR REAL-TIME STRICT DETERMINISTIC LANGUAGESOYAMAGUCHI M; HONDA N; INAGAKI Y et al.1980; INFORM. AND CONTROL; USA; DA. 1980; VOL. 45; NO 1; PP. 90-115; BIBL. 17 REF.Article

VARIATIONS ON THE COMMON SUBEXPRESSION PROBLEMDOWNEY PJ; SETHI R; TARJAN RE et al.1980; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1980; VOL. 27; NO 4; PP. 758-771; BIBL. 21 REF.Article

ZUR KOMPLEXITAET DER PRESBURGER ARITHMETIK UND DES AEQUIVALENZPROBLEMS EINFACHER PROGRAMME = SUR LA COMPLEXITE DE L'ARITHMETIQUE DE PRESBOURG ET DU PROBLEME D'EQUIVALENCE DE PROGRAMMES SIMPLESWOEHL K.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 67; PP. 310-318; BIBL. 12 REF.Conference Paper

A HIERARCHY OF REAL-TIME DETERMINISTIC LANGUAGES AND THEIR EQUIVALENCEAMIRAM YEHU DAI.1982; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 1; PP. 91-100; BIBL. 11 REF.Article