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

1988 Fiscal Year Final Research Report Summary

Investigation in ew Algorithms for Checking Equivalence of Discrete Systems and It's Application

Research Project

Project/Area Number 62550259
Research Category

Grant-in-Aid for General Scientific Research (C)

Allocation TypeSingle-year Grants
Research Field 計算機工学
Research InstitutionThe University of Electro-Communications

Principal Investigator

KASAI Takumi  Associate Professor, The University of Electro-Communications, 電気通信学部, 助教授 (70027382)

Co-Investigator(Kenkyū-buntansha) TAKAHASHI Haruhisa  Assistant Professor, The University of Electro-Communications, 電気通信学部, 講師 (90135418)
Project Period (FY) 1987 – 1988
KeywordsPushdown Automata / 等価性判定アルゴリズム
Research Abstract

First a new algorithm for checking equivalence of simple deterministic pushdown automata is presented. While it is based upon the previously established direct branching algorithm, the key step of new skipping need not be applied repeatedly and it needs to have only one skipping-end in contrast to the previous one.
Secondly, we introduce the concept "probability" into pushdown automata (PDA). According to the properties of errors, PPDA's are classified into unrestricted PPDA's (2-sided erroe PPDA's), RPDA's (1-sided error PPDS's), and BPDA's (bounded erroe PPDA's). It is shown that the class of languages accepted by PPDA's or BPDA's is independent of cut-points. It is also shown that there is an infinite hierarchy of the classes of languages accepted by RPDA's with different cut-points.

  • Research Products

    (11 results)

All Other

All Publications (11 results)

  • [Publications] 若月,藤橋,富田: 電子通信学会論文誌D1. J72. (1989)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Tomita.E.;Seino.K.: Theoretical Computer Science. 365. (1989)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] 陳致中,笠井琢美: 電子通信学会論文誌D. J71ーD. 766-773 (1988)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Iwata.S.;Kasai.T.: Discrete Algorithms and Complexity. 405-416 (1987)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Adachi.A.;Kasai.T.: Discrete Algorithms and Complexity. 311-324 (1987)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Iwata.S.;Kasai.T.: Theoretical Computer Science. 54. 325-329 (1987)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] M. WAKATSUKI; E. TOMITA; C. FUJIHASHI: "A Direct Branching Algorithm for Checking Equivalence of Simple Deterministic Pushdown Automata" IECE of JAPAN. E6. (1989)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] E. TOMITA; K. SEINO: "A Direct Branching Algorithm for checing Equivalence of Two Deterministic Pushdown Transducers, One of Which Is Real-Time Strict" THEORETICAL COMPUTER SCIENCE. 365. (1989)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] S. IWATA; T. KASAI: "Simple Programs With a Fixed Number of Variables Seem Still Hard to Analyze" DISCRETE ALGORITHMS and COMPLEXITY. 405-416 (1987)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] A. ADACHI; T. KASAI: "Are Problems Having a Palynomial Time Upper Bound Actually Thought to be Feasible?" DISCRETE ALGORITHMS and COMPLEXITY. 311-324 (1987)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] S. IWATA; T. KASAI: "Simultaneous (Poly-Time, Log-space) Lower Bounds" THEORETICAL COMPUTER SCIENCE. 54. 325-329 (1987)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 1990-03-20  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi