Mitsuo WAKATSUKI


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 cliquebranch-and-boundapproximate coloringcomputational 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 datacharacteristic samplepolynomial time learningdeterministic restricted one-counter automaton
 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 queriessimple deterministic languagesrepresentative sampleMAT 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 theorydecision algorithminclusion problemdeterministic pushdown automatondeterministic 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 theorydecision algorithmregularity problemdeterministic pushdown automatondeterministic 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 theorydecision algorithminclusion problemdeterministic pushdown automatondeterministic 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 theorydecision algorithminclusion problemdeterministic pushdown automatonstrict 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 problemsimple deterministic pushdown automatonvery simple grammardecision algorithmlanguagetheory
 Summary | Full Text:PDF