| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| NC, MBE, NLP, MICT (Joint) [detail] |
2024-01-25 11:10 |
Tokushima | Naruto University of Education | Realization of Finite Automata using Heteroclinic Mechanism in Continuous-Time Recurrent Networks Naoya Sugawara, Asaki Saito (Future Univ. Hakodate)  NLP2023-105 MICT2023-60 MBE2023-51 |
In this study, we propose a method to construct a continuous-time recurrent network that operates with small inputs and ... [more] | NLP2023-105 MICT2023-60 MBE2023-51 pp.102-105 |
| KBSE | 2020-01-25 15:25 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Speedup of Model-Based Testing for IoT Software Using Virtual Time and State Distribution of Devices Kotaro Tanabe (Tokyo Univ.), Yoshinori Tanabe (Tsurumi Univ.), Masami Hagiya (Tokyo Univ.) KBSE2019-44 |
Modbat is a model-based test tool that performs modeling using an extended finite state automaton(EFSM). In this study, ... [more] | KBSE2019-44 pp.37-42 |
| QIT (2nd) |
2018-11-26 09:50 |
Tokyo | The University of Tokyo | Non-Uniform State Complexity of Quantum Finite Automata and Quantum Polynomial-Time Logarithmic-Space Computation with Quantum Advice
-- (Preliminary Report) -- Tomoyuki Yamakami (U of Fukui) |
The state complexity of a finite(-state) automaton intuitively measures the size of the description of the automaton. Sa... [more] | |
| COMP, IPSJ-AL | 2017-05-13 15:50 |
Nagasaki | On Equivalence of de Bruijn Graphs and State-minimized Finite Automata Yoshiaki Takahashi (Solar), Akira Ito (Yamaguchi Univ.) COMP2017-11 |
A de Bruijn sequence of order n on the alphabet {0,1} is a cyclic sequence in which every possible string of length n ov... [more] | COMP2017-11 pp.77-83 |
|
| COMP | 2009-09-14 10:40 |
Tottori | Tottori University of Environmental Studies | The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata Tomoyuki Yamakami (Univ. of Fukui.) COMP2009-25 |
We discuss the power and limitation of various "advice," when it is given particularly to weak computational models of o... [more] | COMP2009-25 pp.1-8 |
| AI, IPSJ-ICS, JSAI-KBS | 2009-03-02 13:10 |
Miyagi | Laforet Zao Resort & Spa | Strategies of Bounded Rational Players in the Repeated Game Michiharu Masui (Tokyo Inst. ot Tech.) AI2008-64 |
In the fifties Simon pointed out the importance of ``bounded rationality" to economic theory. Since then, the term ``bou... [more] | AI2008-64 pp.1-4 |
| NC | 2006-07-14 14:55 |
Tokyo | Waseda University | A neural circuit model for generating complex birdsong syntax Kentaro Katahira (Univ. of Tokyo), Kazuo Okanoya (RIKEN), Masato Okada (Univ. of Tokyo) |
Abstract The singing behavior of songbirds has been investigated as a model of sequence learning and production. The son... [more] | NC2006-42 pp.25-30 |
| COMP | 2005-03-18 09:50 |
Tokyo | Tokyo Institute of Technology | Equality between Recognizable Expression and Finite Tree Automaton Fumihiko Yamaguchi, Katsunori Yamasaki (Tokyo Univ. of Sci.) |
Tree structured data processing is actively desired because of recent spread of XML and so on. Recognizable Expression... [more] |
COMP2004-75 pp.17-22 |
| COMP | 2004-12-10 10:30 |
Chiba | Toho University | A String Expression for Recognizable Set Fumihiko Yamaguchi, Katsunori Yamasaki (Tokyo Univ. of Sci.) |
Tree is a widely used data structure. Moreover, data processing in tree structure is actively desired because of recent ... [more] | COMP2004-52 pp.1-6 |
[Return to Top Page]