Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Etsuro Moriya

dblp:32/1219 · DBLP profile ↗
← Back
10ranked-venue papers
8as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 9 · 7 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
3 papers
Computational complexity · 75% Automata and formal languages · 25%

Topics — the 7 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational complexity › computational models
nondeterministic turing machines
0.011986
A Note on some Simultaneous Relations among Time, Space, and Reversal for Single Work Tape Nondeterministic Turing Machines · Inf. Control. 1986
Computational complexity
time-space tradeoffs
0.011986
A Note on some Simultaneous Relations among Time, Space, and Reversal for Single Work Tape Nondeterministic Turing Machines · Inf. Control. 1986
Computational complexity › complexity measures
turing machine complexity
0.011986
A Note on some Simultaneous Relations among Time, Space, and Reversal for Single Work Tape Nondeterministic Turing Machines · Inf. Control. 1986
Automata and formal languages
turing machines
0.011986
A Note on some Simultaneous Relations among Time, Space, and Reversal for Single Work Tape Nondeterministic Turing Machines · Inf. Control. 1986
Automata and formal languages › formal grammars
derivational complexity
0.011973
Associate Languages and Derivational Complexity of Formal Grammars and Languages · Inf. Control. 1973
Automata and formal languages
formal grammars
0.011973
Associate Languages and Derivational Complexity of Formal Grammars and Languages · Inf. Control. 1973
Automata and formal languages › formal grammars › regulated rewriting
matrix grammars
0.011973
Some Remarks on State Grammars and Matrix Grammars · Inf. Control. 1973
YearPublicationVenuePosition
2008 On Alternating Phrase-Structure Grammars
Etsuro Moriya, Friedrich Otto
LATA1
2005 On state-alternating context-free grammars
Etsuro Moriya, Dieter Hofbauer, Maria Huber, Friedrich Otto
Theor. Comput. Sci.1
1994 On Two-Way Tree Automata
Etsuro Moriya
Inf. Process. Lett.1
1993 Relations among Simultaneous Complexity Classes of Nondeterministic and Alternating Turing Machines
Shigeki Iwata, Takumi Kasai, Etsuro Moriya
Acta Informatica3
1989 A Grammatical Characterization of Alternating Pushdown Automata
Etsuro Moriya
Theor. Comput. Sci.1
1986 A Note on some Simultaneous Relations among Time, Space, and Reversal for Single Work Tape Nondeterministic Turing Machines
Etsuro Moriya, Shigeki Iwata, Takumi Kasai
Inf. Control.1
1979 A Theoretical Study of the Time Analysis of Programs
Akeo Adachi, Takumi Kasai, Etsuro Moriya
MFCS3
1975 Characterization theorems on abstract families of transducers
Etsuro Moriya
Inf. Sci.1
1973 Associate Languages and Derivational Complexity of Formal Grammars and Languages
Etsuro Moriya
Inf. Control.1
1973 Some Remarks on State Grammars and Matrix Grammars
Etsuro Moriya
Inf. Control.1