IEICE Trans

Etsuji TOMITA

A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments Etsuji TOMITA Yoichi SUTANI Takanori HIGASHI Mitsuo WAKATSUKI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2013/06/01 Vol. E96-D No. 6 pp. 1286-1298 Type of Manuscript: PAPER Category: Fundamentals of Information Systems Keyword: maximum clique, branch-and-bound, approximate coloring, computational experiments,
	Summary \| Full Text:PDF

Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data Mitsuo WAKATSUKI Etsuji TOMITA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2008/06/01 Vol. E91-D No. 6 pp. 1704-1718 Type of Manuscript: PAPER Category: Algorithm Theory Keyword: identification in the limit from positive data, characteristic sample, polynomial time learning, deterministic restricted one-counter automaton,
	Summary \| Full Text:PDF

Dynamic Programming and Clique Based Approaches for Protein Threading with Profiles and Constraints Tatsuya AKUTSU Morihiro HAYASHIDA Dukka Bahadur K.C. Etsuji TOMITA Jun'ichi SUZUKI Katsuhisa HORIMOTO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/05/01 Vol. E89-A No. 5 pp. 1215-1222 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: maximum edge weight clique, dynamic programming, protein threading, profiles, distance constraints,
	Summary \| Full Text:PDF

Polynomial Time Learnability of Simple Deterministic Languages from MAT and a Representative Sample Yasuhiro TAJIMA Etsuji TOMITA Mitsuo WAKATSUKI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2000/04/25 Vol. E83-D No. 4 pp. 757-765 Type of Manuscript: PAPER Category: Theory of Automata, Formal Language Theory Keyword: learning via queries, simple deterministic languages, representative sample, MAT learning,
	Summary \| Full Text:PDF

A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Accept Mode Ken HIGUCHI Mitsuo WAKATSUKI Etsuji TOMITA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1998/01/25 Vol. E81-D No. 1 pp. 1-11 Type of Manuscript: PAPER Category: Automata,Languages and Theory of Computing Keyword: language theory, decision algorithm, inclusion problem, deterministic pushdown automaton, deterministic restricted one-counter automaton,
	Summary \| Full Text:PDF

Some Properties of Deterministic Restricted One-Counter Automata Ken HIGUCHI Mitsuo WAKATSUKI Etsuji TOMITA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1996/07/25 Vol. E79-D No. 7 pp. 914-924 Type of Manuscript: PAPER Category: Automata,Languages and Theory of Computing Keyword: language theory, decision algorithm, regularity problem, deterministic pushdown automaton, deterministic restricted one-counter automaton,
	Summary \| Full Text:PDF

A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Final State Ken HIGUCHI Mitsuo WAKATSUKI Etsuji TOMITA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1995/08/25 Vol. E78-D No. 8 pp. 939-950 Type of Manuscript: PAPER Category: Automata, Languages and Theory of Computing Keyword: language theory, decision algorithm, inclusion problem, deterministic pushdown automaton, deterministic restricted one-counter automaton,
	Summary \| Full Text:PDF

A Polynomial-Time Algorithm for Checking the Inclusion for Strict Deterministic Restricted One-Counter Automata Ken HIGUCHI Etsuji TOMITA Mitsuo WAKATSUKI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1995/04/25 Vol. E78-D No. 4 pp. 305-313 Type of Manuscript: PAPER Category: Automata, Languages and Theory of Computing Keyword: language theory, decision algorithm, inclusion problem, deterministic pushdown automaton, strict deterministic restricted one-counter automaton,
	Summary \| Full Text:PDF

A Fast Algorithm for Checking the Inclusion for Very Simple Deterministic Pushdown Automata Mitsuo WAKATSUKI Etsuji TOMITA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1993/10/25 Vol. E76-D No. 10 pp. 1224-1233 Type of Manuscript: PAPER Category: Automaton, Language and Theory of Computing Keyword: inclusion problem, simple deterministic pushdown automaton, very simple grammar, decision algorithm, languagetheory,
	Summary \| Full Text:PDF

A Direct Branching Algorithm for Checking Equivalence of Finite-Turn DPDA's Etsuji TOMITA Masahiro IGARASHI
Publication: IEICE TRANSACTIONS (1976-1990) Publication Date: 1986/03/25 Vol. E69-E No. 3 pp. 193-195 Type of Manuscript: LETTER Category: Automata and Languages Keyword:
	Summary \| Full Text:PDF