E. Moriya

On State-Alternating Context-Free Grammars – With Detailed Proofs and Supplementary Results – Technical Report No . 2003-5 Etsuro Moriya

E. Moriya, 2014 .

More 2 on the Subgraph Connecting Problem – Counting and Optimization Variants and Their Complexity

E. Moriya, D. Kawasaki, 2005 .

A Theoretical Study of the Time Analysis of Programs

Etsuro Moriya, Akeo Adachi, Takumi Kasai, 1979, International Symposium on Mathematical Foundations of Computer Science.

Associate Languages and Derivational Complexity of Formal Grammars and Languages

Etsuro Moriya, E. Moriya, 1973, Inf. Control..

On The Space Complexity Of Turn Bounded Pushdown Automata

Etsuro Moriya, Takemaru Tada, E. Moriya, 2003, Int. J. Comput. Math..

On state-alternating context-free grammars

Friedrich Otto, Etsuro Moriya, Dieter Hofbauer, 2005, Theor. Comput. Sci..

Shrinking alternating two-pushdown automata (New Aspects of Theoretical Computer Science)

Friedrich Otto, Etsuro Moriya, F. Otto, 2003 .

On Two-Way Tree Automata

Etsuro Moriya, E. Moriya, 1994, Inf. Process. Lett..

Some Remarks on State Grammars and Matrix Grammars

Etsuro Moriya, E. Moriya, 1973, Inf. Control..

A Grammatical Characterization of Alternating Pushdown Automata

Etsuro Moriya, E. Moriya, 1989, Theor. Comput. Sci..