| 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 # | |
| IT | 2022-07-21 14:55 |
Okayama | Okayama University of Science (Primary: On-site, Secondary: Online) |
A Data Compression Method Where The Codeword Is a Computer Program Generating The Data Mitsuharu Arimura (Shonan Inst. Tech.)  IT2022-19 |
The Kolmogorov complexity of a string is defined as the shortest length of the program on a Turing machine used to repre... [more] | IT2022-19 pp.18-23 |
| SS | 2021-03-03 10:00 |
Online | Online | Weighted Multiple Context-free Grammars and their Properties Yusuke Inoue, Hiroyuki Seki (Nagoya Univ.) SS2020-28 |
Multiple context-free grammar (MCFG) is an extension of context-free grammar that generates tuples of strings. MCFG has ... [more] | SS2020-28 pp.1-6 |
| MSS, SS | 2021-01-27 15:25 |
Online | Online | Pumping Lemmas for Languages Expressed by Computational Models with Registers Rindo Nakanishi, Ryoma Senda (Nagoya Univ.), Yoshiaki Takata (KUT), Hiroyuki Seki (Nagoya Univ.) MSS2020-41 SS2020-26 |
Register automaton (RA), register context-free grammar (RCFG), and register tree automaton (RTA) are computational model... [more] | MSS2020-41 SS2020-26 pp.72-77 |
| SS, MSS | 2018-01-18 14:15 |
Hiroshima | Computational Complexity of Membership and Emptiness Problems for Register Context-Free Grammars Ryoma Senda, Hiroyuki Seki (Nagoya Univ.) MSS2017-54 SS2017-41 |
Register context-free grammar (RCFG) is an extension of context-free grammar to handle data values. RCFGs can be applied... [more] | MSS2017-54 SS2017-41 pp.41-46 |
|
| COMP | 2014-12-05 15:25 |
Kumamoto | Sojo University | Homomorphism-Substitutable Context-free Languages and Learning Algorithm Takayuki Kuriyama (Sokendai/ NII) COMP2014-38 |
We generalized the class of $k,l$-substitutable languages (Yoshinala, 2008). Each language in the generalized class is c... [more] | COMP2014-38 pp.37-44 |
| COMP | 2013-12-20 09:30 |
Okinawa | Okinawa Industry Support Center | Reflections on a CFL decision problem "L(G)=Σ* ?" Eiiichi Tanaka COMP2013-38 |
The decision problem "whether a context free grammar G generates all terminal strings or not" has been considered to be ... [more] | COMP2013-38 pp.1-6 |
| COMP | 2013-12-21 14:55 |
Okinawa | Okinawa Industry Support Center | On alternation-bounded alternating context-free grammars and languages Etsuro Moriya (Waseda Univ.) COMP2013-56 |
Alternating context-free grammars, in which the number of alternations between existential and universal modes is bounde... [more] | COMP2013-56 pp.107-114 |
| COMP | 2013-09-03 11:20 |
Tottori | Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages
-- (Preliminary Version) -- Tomoyuki Yamakami (Univ. of Fukui) COMP2013-27 |
We impose various oracle mechanisms on nondeterministic pushdown automata, which naturally induce nondeterministic reduc... [more] | COMP2013-27 pp.17-24 |
|
| COMP, IPSJ-AL | 2012-05-14 15:15 |
Ehime | Ehime University | On Context-free Languages That Cannot Be Recognized by Limited Backtrack Top-down Parsers Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2012-11 |
Recently, deterministic parsing with bounded lookahead and limited backtrack top-down parsing have been used for parsing... [more] | COMP2012-11 pp.45-50 |
| COMP | 2011-04-22 09:30 |
Kyoto | Kyoto University | A construction method for non-left-recursive parsing expression grammars Shunichi Matsubara, Shojiro Ogawa, Marin J. Duerst (Aoyama Gakuin Univ.) COMP2011-1 |
Parsing expression grammars (PEGs) have recently been used to describe the syntax of artificial languages such as progra... [more] | COMP2011-1 pp.1-8 |
| PRMU | 2008-02-22 09:00 |
Ibaraki | Univ. of Tsukuba | Online Handwritten Kanji String Recognition Based on Grammar Description of Character Structures Ikumi Ota, Ryo Yamamoto, Takuya Nishimoto, Shigeki Sagayama (Univ. of Tokyo) PRMU2007-227 |
In this paper, we discuss a method for online handwritten Kanji character recognition by describing the structure of Kan... [more] | PRMU2007-227 pp.75-80 |
[Return to Top Page]