A DIRECT BRANCHING ALGORITHM FOR CHECKING EQUIVALENCE OF SOME CLASSES OF DETERMINISTIC PUSHDOWN AUTOMATATOMITA E.1982; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 52; NO 2; PP. 187-238; BIBL. 23 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

A DECISION PROCEDURE FOR THE EQUIVALENCE OF TWO DPDAS ONE OF WHICH IS LINEARITZHAIK Y; YEHUDAI A.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 229-237; BIBL. 13 REF.Conference Paper

ONE-WAY WEAK-STACK-COUNTER AUTOMATAMIYANO S.1980; J. COMPUTER SYST. SCI.; USA; DA. 1980; VOL. 20; NO 1; PP. 59-76; BIBL. 13 REF.Article

CONCEPTION ET OPTIMISATION DES DESCENTES RECURSIVESHUA THANH HUY.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 83; PP. 162-176; ABS. ENG; BIBL. 22 REF.Conference Paper

THEOREME DE TRANSVERSALE RATIONNELLE POUR LES AUTOMATES A PILE DETERMINISTESSAKAROVITCH J.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 67; PP. 276-285; BIBL. 13 REF.Conference Paper

A NOTE ON A FAMILY OF ACCEPTORS FOR SOME FAMILIES OF DEVELOPMENTAL LANGUAGES.ROZENBERG G; WOOD D.1976; INTERNATION. J. COMPUTER MATH.; U.S.A.; DA. 1976; VOL. 5; NO 4; PP. 261-266; BIBL. 6 REF.Article

A CLASS OF BINARY RATE ONE-HALF CONVOLUTIONAL CODES THAT ALLOWS AN IMPROVED STACK DECODERVINCK AJ; DE PAEPE AJP; ASCHALKWIJK JPM et al.1980; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1980; VOL. 26; NO 4; PP. 389-392; BIBL. 8 REF.Article

A TURING MACHINE SPACE HIERARCHYZAK S.1979; KYBERNETIKA; CSK; DA. 1979; VOL. 15; NO 2; PP. 100-121; BIBL. 9 REF.Article

ON SALOMAA'S ABSTRACT PUSHDOWN AUTOMATA.HUZINO S.1978; MEM. FAC. SCI. KYUSHU UNIV., A; JPN; DA. 1978; VOL. 32; NO 1; PP. 67-71; BIBL. 4 REF.Article

REVERSAL-BOUNDED MULTICOUNTER MACHINES AND THEIR DECISION PROBLEMS.IBARRA OH.1978; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1978; VOL. 25; NO 1; PP. 116-133; BIBL. 27 REF.Article

ON JUMP-DETERMINISTIC PUSDOWN AUTOMATACOURCELLE B.1977; MATH. SYST. THEORY; USA; DA. 1977; VOL. 11; NO 2; PP. 87-109; BIBL. 26 REF.Article

ON THE RECURSION-THEORETIC COMPLEXITY OF RELATIVE SUCCINCTNESS OF REPRESENTATIONS OF LANGUAGESHAY L.1982; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1982; VOL. 52; NO 1; PP. 2-7; BIBL. 5 REF.Article

INSOLUBILITE DU PROBLEME D'IDENTITE POUR LES LANGAGES A PILES BORNEESLISOVIK LP.1980; KIBERNETIKA; UKR; DA. 1980; NO 6; PP. 123; BIBL. 2 REF.Article

ON THE PROOF OF A THEOREM BY CHOMSKY-HOPCROFT-ULLMANOEMRAWSINGH H; OLLONGREN A.1979; INTERNATION. J. COMPUTER MATH.; USA; DA. 1979; VOL. 7; NO 1; PP. 37-41; BIBL. 1 REF.Article

TWO DECIDABILITY RESULTS FOR DETERMINISTIC PUSHDOWN AUTOMATALINNA M.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 18; NO 1; PP. 92-107; BIBL. 13 REF.Article

ON AN AUTOMATON EQUIPPED WITH A MECHANISM OF RECURSIVE CALLHUZINO S.1978; MEM. FAC. SCI. KYUSHU UNIV., A; JPN; DA. 1978; VOL. 32; NO 2; PP. 223-228; BIBL. 3 REF.Article

POLYNOMIAL ALGORITHMS FOR DETERMINISTIC PUSHDOWN AUTOMATAROSENKRANTZ DJ; HUNT HB III.1978; S. I.A.M.J. COMPUTG; USA; DA. 1978; VOL. 7; NO 4; PP. 405-412; BIBL. 18 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

AN ALGORITHM FOR DETERMINING EQUIVALENCE OF TWO DETERMINISTIC PUSHDOWN TRANSDUCERS.KATAYAMA T; ENOMOTO H; TSUCHIYA N et al.1975; SYST. COMPUTERS CONTROLS; U.S.A.; DA. 1975 PARU 1976; VOL. 6; NO 6; PP. 69-77; BIBL. 7 REF.Article

AN EXTENDED RESULT ON THE EQUIVALENCE PROBLEM FOR LR MACHINES TAKING MONOTONOUS EPSILON -MOVESSEKIMOTO S.1981; SYSTEMS, COMPUTERS, CONTROLS; ISSN 0096-8765; USA; DA. 1981-1982; VOL. 12; NO 3; PP. 30-37; BIBL. 9 REF.Article

AN ACCEPTOR FOR ALGEBRAIC POWER SERIESWECHLER W.1979; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DDR; DA. 1979; VOL. 15; NO 12; PP. 611-619; ABS. GER/RUS; BIBL. 4 REF.Article

ON INFERENCING DYNAMICS OF AUTOMATA FROM FINITE SAMPLESHUZINO S.1978; MEM. FAC. SCI. KYUSHU UNIV., A; JPN; DA. 1978; VOL. 32; NO 2; PP. 291-299; BIBL. 3 REF.Article

SOME OPEN PROBLEMS IN THE THEORY OF COMPUTATION AS QUESTIONS ABOUT TWO-WAY DETERMINISTIC PUSHDOWN AUTOMATON LANGUAGES.GALIL Z.1976; MATH. SYST. THEORY; U.S.A.; DA. 1976-1977; VOL. 10; NO 3; PP. 211-228; BIBL. 1 P.Article

Some remarks on subclass containment problems for several classes of DPPA'SOYAMAGUCHI, M.Information processing letters. 1984, Vol 19, Num 1, pp 9-12, issn 0020-0190Article