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

AN AXIOMATIC APPROACH TO THE KORENJAK-HOPCROFT ALGORITHMSCOURCELLE B.1983; MATHEMATICAL SYSTEMS THEORY; ISSN 0025-5661; DEU; DA. 1983; VOL. 16; NO 3; PP. 191-231; BIBL. 21 REF.Article

ON THE DECIDABILITY OF EQUIVALENCE FOR DETERMINISTIC PUSHDOWN TRANSDUCERIBARRA OH; ROSIER LE.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 3; PP. 89-93; BIBL. 20 REF.Article

TREE EQUIVALENCE OF LINEAR RECURSIVE SCHEMATA IS POLYNOMIAL-TIME DECIDABLESABELFELD VK.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 4-5; PP. 147-153; BIBL. 11 REF.Article

RESTRICTED ONE-COUNTER MACHINES WITH UNDECIDABLE UNIVERSE PROBLEMSIBARRA OH.1979; MATH. SYST. THEORY; USA; DA. 1979; VOL. 13; NO 2; PP. 181-186; BIBL. 10 REF.Article

THE INCLUSION PROBLEM FOR DOL LANGUAGESRUOHONEN K.1979; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DDR; DA. 1979; VOL. 15; NO 11; PP. 535-548; ABS. RUS/GER; BIBL. 13 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

DOMINOES OVER A FREE MONOIDCULIK K II; HARJU T.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 18; NO 3; PP. 279-300; BIBL. 7 REF.Article

ON THE EQUIVALENCE PROBLEM FOR BINARY DOL SYSTEMSKARHUMAEKI J.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 339-347; BIBL. 12 REF.Conference Paper

ON THE EQUIVALENCE PROBLEM FOR BINARY DOL SYSTEMSKARHUMAEKI J.1982; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 50; NO 3; PP. 276-284; BIBL. 12 REF.Article

STRAIGHT-LINE PROGRAMS WITH ONE INPUT VARIABLEIBARRA OH; LEININGER BS.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 1; PP. 1-14; BIBL. 7 REF.Article

THE EQUIVALENCE PROBLEM FOR DETERMINISTIC TWO WAY PROBLEM SEQUENTIAL TRANSDUCERS IS DECIDABLEGURARI EM.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 3; PP. 448-452; BIBL. 9 REF.Article

THE EQUIVALENCE PROBLEM FOR LL- AND LR-REGULAR GRAMMARSNIJHOLT A.1982; JOURNAL OF COMPUTER AND SYSTEM SCIENCES; ISSN 0022-0000; USA; DA. 1982; VOL. 24; NO 2; PP. 149-161; BIBL. 22 REF.Article

SUPERDETERMINISTIC DPDAS: THE METHOD OF ACCEPTING DOES AFFECT DECISION PROBLEMSFRIEDMAN EP; GREIBACH SA.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 19; NO 1; PP. 79-117; BIBL. 25 REF.Article