The search functionality is under construction.

The search functionality is under construction.

Two-Terminal Series Parallel (TTSP, for short) graphs are used as data models in applications for electric networks and scheduling problems. We propose a TTSP term graph which is a TTSP graph having structured variables, that is, a graph pattern over a TTSP graph. Let *TG _{TTSP}* be the set of all TTSP term graphs whose variable labels are mutually distinct. For a TTSP term graph

- Publication
- IEICE TRANSACTIONS on Information Vol.E92-D No.2 pp.181-190

- Publication Date
- 2009/02/01

- Publicized

- Online ISSN
- 1745-1361

- DOI
- 10.1587/transinf.E92.D.181

- Type of Manuscript
- Special Section PAPER (Special Section on Foundations of Computer Science)

- Category

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Ryoji TAKAMI, Yusuke SUZUKI, Tomoyuki UCHIDA, Takayoshi SHOUDAI, "Polynomial Time Inductive Inference of TTSP Graph Languages from Positive Data" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 2, pp. 181-190, February 2009, doi: 10.1587/transinf.E92.D.181.

Abstract: Two-Terminal Series Parallel (TTSP, for short) graphs are used as data models in applications for electric networks and scheduling problems. We propose a TTSP term graph which is a TTSP graph having structured variables, that is, a graph pattern over a TTSP graph. Let *TG _{TTSP}* be the set of all TTSP term graphs whose variable labels are mutually distinct. For a TTSP term graph

URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.181/_p

Copy

@ARTICLE{e92-d_2_181,

author={Ryoji TAKAMI, Yusuke SUZUKI, Tomoyuki UCHIDA, Takayoshi SHOUDAI, },

journal={IEICE TRANSACTIONS on Information},

title={Polynomial Time Inductive Inference of TTSP Graph Languages from Positive Data},

year={2009},

volume={E92-D},

number={2},

pages={181-190},

abstract={Two-Terminal Series Parallel (TTSP, for short) graphs are used as data models in applications for electric networks and scheduling problems. We propose a TTSP term graph which is a TTSP graph having structured variables, that is, a graph pattern over a TTSP graph. Let *TG _{TTSP}* be the set of all TTSP term graphs whose variable labels are mutually distinct. For a TTSP term graph

keywords={},

doi={10.1587/transinf.E92.D.181},

ISSN={1745-1361},

month={February},}

Copy

TY - JOUR

TI - Polynomial Time Inductive Inference of TTSP Graph Languages from Positive Data

T2 - IEICE TRANSACTIONS on Information

SP - 181

EP - 190

AU - Ryoji TAKAMI

AU - Yusuke SUZUKI

AU - Tomoyuki UCHIDA

AU - Takayoshi SHOUDAI

PY - 2009

DO - 10.1587/transinf.E92.D.181

JO - IEICE TRANSACTIONS on Information

SN - 1745-1361

VL - E92-D

IS - 2

JA - IEICE TRANSACTIONS on Information

Y1 - February 2009

AB - Two-Terminal Series Parallel (TTSP, for short) graphs are used as data models in applications for electric networks and scheduling problems. We propose a TTSP term graph which is a TTSP graph having structured variables, that is, a graph pattern over a TTSP graph. Let *TG _{TTSP}* be the set of all TTSP term graphs whose variable labels are mutually distinct. For a TTSP term graph

ER -