• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2007 Fiscal Year Final Research Report Summary

Developments of LearningAlgorithms for Deterministic Context-Free Languages in Some Classes and Their Applications

Research Project

Project/Area Number 18500108
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Intelligent informatics
Research InstitutionThe University of Electro-Communications

Principal Investigator

WAKATSUKI Mitsuo  The University of Electro-Communications, Faculty of Electro-Communications, Assistant Professor (30251705)

Project Period (FY) 2006 – 2007
Keywordscomputational learning theory / learning from positive data / identification in the limit / checking the equivalence / algorithm / context-free languages / pushdown automata / transducers
Research Abstract

The machine learning is one of the most important research fields for the realization of the artificial intelligence, and the computational learning theory is a paradigm which analyzes mathematically about the possibility for the machine learning. In formal language theory, the class of deterministic context-free languages is important in practical use. In this research, we are concerned with some subclasses of deterministic pushdown automata (dpda's for short) which accept deterministic context-free languages and the corresponding subclasses of formal grammars. The aim of this research is to develop learning algorithms for subclasses of dpda's and to apply these algorithms to practical problems.
We had the following research results.
1. Basics to develop learning algorithms: We have proposed a simple and direct algorithm for checking the equivalence of a certain pair of non-real-time deterministic pushdown transducers (dpdt's for short), where dpdt's are obtained by attaching the output function to dpda's. In addition, we have given a polynomial-time algorithm for checking the equivalence of real-time strict deterministic restricted one-counter transducers, which are real-time dpdt's that have just one stack symbol. We know that the equivalence checking algorithm plays an important role in learning systems which are formulated as automata and formal grammars. These results can be used for learning via queries for some subclasses of dpdt's.
2. Developments of learning algorithms: We have presented a unified identification algorithm in the limit from positive data for the extended class defined by a class of languages to be based on and a class of finite subsets of strings. Furthermore, we have proved that a subclass of dpda's called Szilard strict deterministic restricted one-counter automata and a certain subclass of finite state transducers are polynomial time identifiable in the limit from positive data.

  • Research Products

    (17 results)

All 2008 2007 2006 Other

All Journal Article (8 results) (of which Peer Reviewed: 4 results) Presentation (8 results) Remarks (1 results)

  • [Journal Article] 実時間空スタック受理式決定性限定ワンカウンタ変換器の多項式時間等価性判定2008

    • Author(s)
      清野和司, 富田悦次, 若月光夫
    • Journal Title

      電子情報通信学会論文誌D分冊 J91-D

      Pages: 1188-1201

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
  • [Journal Article] Polynomial time identification of strict deterministic restricted one-counter automata in some class from positive data2008

    • Author(s)
      Mitsuo Wakatsuki and Etsuji Tomita
    • Journal Title

      IEICE Transactions on Information and Systems E91-D(6月掲載確定)

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
  • [Journal Article] A polynomial-time algorithm for checking the equivalence of real-time strict deterministic restricted one-counter transducers2008

    • Author(s)
      Kazushi, Seino, Etsuji, Tomita, Mitsuo, Wakatsuki
    • Journal Title

      The IEICE Transactions on Information and Systems (Japanese Edition) J91-D 5)

      Pages: 1188-1201

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] Polynomial time identification of strict deterministic restricted one-counter automata in some class from positive data2008

    • Author(s)
      Mitsuo, Wakatsuki, Etsuji, Tomita
    • Journal Title

      The IEICE Transactions on Information and Systems E91-D 6)(to appear)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] ε-推移を許したある決定性プッシュダウン変換器対の等価性判定2007

    • Author(s)
      清野和司, 富田悦次, 若月光夫
    • Journal Title

      電子情報通信学会論文誌D分冊 J90-D

      Pages: 2675-2690

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
  • [Journal Article] A direct branching algorithm for checking the equivalence of a pair of non-real-time deterministic pushdown transducers2007

    • Author(s)
      Kazushi, Seino, Etsuji, Tomita, Mitsuo, Wakatsuki
    • Journal Title

      The IEICE Transactions on Information and Systems (Japanese Edition) J90-D 10)

      Pages: 2675-2690

    • Description
      「研究成果報告書概要(欧文)」より
  • [Journal Article] A unified algorithm for extending classes of languages identifiable in the limit from positive data2006

    • Author(s)
      Mitsuo Wakatsuki, Etsuji Tomita and GoYamada
    • Journal Title

      Lecture Notes in Artificial Intelligence, Proceedings of ICGI2006(Springer) 4201

      Pages: 161-174

    • Description
      「研究成果報告書概要(和文)」より
    • Peer Reviewed
  • [Journal Article] A unified algorithm for extending classes of languages identifiable in the limit from positive data2006

    • Author(s)
      Mitsuo, Wakatsuki, Etsuji, Tomita, Go, Yamada
    • Journal Title

      Lecture Notes in Artificial Intelligence, Proceedings of ICGI2006 (Springer) 4201

      Pages: 161-174

    • Description
      「研究成果報告書概要(欧文)」より
  • [Presentation] Polynomial time identification of finite state transducers in some class2007

    • Author(s)
      若月光夫, 富田悦次
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      新潟大学大学院自然科学研究科 管理棟 2階 小会議室
    • Year and Date
      2007-11-30
    • Description
      「研究成果報告書概要(和文)」より
  • [Presentation] Polynomial time identification of finite state transducers in some class2007

    • Author(s)
      Mitsuo, Wakatsuki, Etsuji, Tomita
    • Organizer
      IPSJ, The Special Interest Group on Algorithms
    • Place of Presentation
      Niigata University, Niigata, Japan
    • Year and Date
      2007-11-30
    • Description
      「研究成果報告書概要(欧文)」より
  • [Presentation] 実時間空スタック受理式決定性限定ワンカウンター変換器の多項式時間等価性判定アルゴリズム2007

    • Author(s)
      清野和司, 富田悦次, 若月光夫
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      東北大学工学部電子情報システム・応物系 1号館 451・453号室
    • Year and Date
      2007-10-16
    • Description
      「研究成果報告書概要(和文)」より
  • [Presentation] A polynomial-time algorithm for checking the equivalence of real-time strict deterministic restricted one-counter transducers2007

    • Author(s)
      Kazushi, Seino, Etsuji, Tomita, Mitsuo, Wakatsuki
    • Organizer
      IEICE, The Technical Group on Computation
    • Place of Presentation
      Tohoku University, Sendai, Japan
    • Year and Date
      2007-10-16
    • Description
      「研究成果報告書概要(欧文)」より
  • [Presentation] Polynomial time identification of finite state transducers in some class2007

    • Author(s)
      Mitsuo Wakatsuki and Etsuji Tomita
    • Organizer
      ICT Triangle Forum 2007(Advanced ICT 2007)
    • Place of Presentation
      Beijing Uhiversity of Posts and Telecommunications, Beijing, China
    • Year and Date
      2007-09-20
    • Description
      「研究成果報告書概要(和文)」より
  • [Presentation] Polynomial time identification of finite state transducers in some class2007

    • Author(s)
      Mitsuo, Wakatsuki, Etsuji, Tomita
    • Organizer
      ICT Triangle Forum 2007 (Advanced ICT 2007)
    • Place of Presentation
      Beijing University of Posts and Telecommunications, Beijing, China
    • Year and Date
      2007-09-20
    • Description
      「研究成果報告書概要(欧文)」より
  • [Presentation] A unified algorithn for extending classes of languages identifiable in the limit from positive data2006

    • Author(s)
      Mitsuo Wakatsuki, Etsuji Tomita and Go Yamada
    • Organizer
      2006年度夏のLAシンポジウム
    • Place of Presentation
      西条グランドホテル(広島県東広島市)
    • Year and Date
      2006-08-03
    • Description
      「研究成果報告書概要(和文)」より
  • [Presentation] A unified algorithm for extending classes of languages identifiable in the limit from positive data2006

    • Author(s)
      Mitsuo, Wakatsuki, Etsuji, Tomita, Go, Yamada
    • Organizer
      LA Symposium 2006 in summer
    • Place of Presentation
      Saijo Grand Hotel, Hiroshima, Japan
    • Year and Date
      2006-08-03
    • Description
      「研究成果報告書概要(欧文)」より
  • [Remarks] 「研究成果報告書概要(和文)」より

    • URL

      http://kjk.office.uec.ac.jp/Profiles/0001/0000405/profile.html

URL: 

Published: 2010-02-04  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi