ASSOCIATE LANGUAGES AND DERIVATIONAL COMPLEXITY OF FORMAL GRAMMARS AND LANGUAGESMORIYA E.1973; INFORM. AND CONTROL; U.S.A.; DA. 1973; VOL. 22; NO 2; PP. 139-162; BIBL. 1 P. 1/2Serial Issue

A grammatical characterization of alternating pushdown automataMORIYA, E.Theoretical computer science. 1989, Vol 67, Num 1, pp 75-85, issn 0304-3975Article

On two-way tree automataMORIYA, E.Information processing letters. 1994, Vol 50, Num 3, pp 117-121, issn 0020-0190Article

A THEORETICAL STUDY ON THE TIME ANALYSIS OF PROGRAMSADACHI A; KASAI T; MORIYA E et al.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 201-207; BIBL. 5 REF.Conference Paper

MESSAGE CONTROL IN A REAL TIME SYSTEMMAISUDA K; MORIYA E; IKEDA R et al.1978; REV. ELECTR. COMMUNIC. LAB.; JPN; DA. 1978; VOL. 26; NO 1-2; PP. 24-32; BIBL. 7 REF.Article

Optimally fast shortest path algorithms for some classes of graphsMORIYA, E; TSUGANE, K.International journal of computer mathematics. 1998, Vol 70, Num 2, pp 297-317, issn 0020-7160Article

Relations among simultaneous complexity classes of nondeterministic and alternating turing machinesIWATA, S; KASAI, T; MORIYA, E et al.Acta informatica. 1993, Vol 30, Num 3, pp 267-278, issn 0001-5903Article