THE TREE-EQUIVALENCE PROBLEM FOR LINEAR RECURSIVE SCHEMAS

被引：0
|
作者：
SABELFELD, VK [1 ]
机构：
[1] RUSSIAN ACAD SCI, INST INFORMAT SYST, SIBERIAN BRANCH, NOVOSIBIRSK, RUSSIA
来源：
PROGRAMMING AND COMPUTER SOFTWARE | 1994年 / 20卷 / 06期
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
In this paper we construct a complete system of transformations that preserve the relation of tree equivalence for linear recursive schemas; we also present an algorithm with polynomial complexity for recognition of this type of equivalence in linear recursive systems.
引用
收藏
页码：258 / 274
页数：17
相关论文
共 50 条
  • [1] COMPLETENESS RESULTS FOR EQUIVALENCE OF RECURSIVE SCHEMAS
    COURCELLE, B
    VUILLEMIN, J
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 12 (02) : 179 - 197
  • [2] TREE EQUIVALENCE OF LINEAR RECURSIVE SCHEMATA IS POLYNOMIAL-TIME DECIDABLE
    SABELFELD, VK
    [J]. INFORMATION PROCESSING LETTERS, 1981, 13 (4-5) : 147 - 153
  • [3] Equivalence of conservative, free, linear program schemas is decidable
    Laurence, MR
    Danicic, S
    Harman, M
    Hierons, R
    Howroyd, J
    [J]. THEORETICAL COMPUTER SCIENCE, 2003, 290 (01) : 831 - 862
  • [4] On the decidability of the equivalence problem for monadic recursive programs
    Zakharov, VA
    [J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2000, 34 (02): : 157 - 171
  • [5] The tree equivalence of linear recursion schemes
    Sabelfeld, V
    [J]. THEORETICAL COMPUTER SCIENCE, 2000, 238 (1-2) : 1 - 29
  • [6] DECIDABLE SUBCASES OF THE EQUIVALENCE PROBLEM FOR RECURSIVE PROGRAM SCHEMES
    COURCELLE, B
    GALLIER, JH
    [J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1987, 21 (03): : 245 - 286
  • [7] LANGUAGES OF INTERPRETATION OF RECURSIVE SCHEMAS
    COUSINEAU, FG
    RIFFLET, JM
    [J]. REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1975, 9 (NR1): : 21 - 42
  • [8] EQUIVALENCE SOLVABILITY OF LINEAR UNARY RECURSIVE SCHEMES WITH INDIVIDUAL CONSTANTS
    ROMANOVSKY, VY
    [J]. DOPOVIDI AKADEMII NAUK UKRAINSKOI RSR SERIYA A-FIZIKO-MATEMATICHNI TA TECHNICHNI NAUKI, 1980, (01): : 71 - 74
  • [9] EQUIVALENCE PROBLEM SOLVABILITY FOR ONE SUBCLASS OF UNARY RECURSIVE SCHEMES
    ROMANOVSKIJ, VJ
    [J]. DOPOVIDI AKADEMII NAUK UKRAINSKOI RSR SERIYA A-FIZIKO-MATEMATICHNI TA TECHNICHNI NAUKI, 1976, (10): : 885 - 886
  • [10] Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
    Danicic, Sebastian
    Harman, Mark
    Hierons, Rob
    Howroyd, John
    Laurence, Michael R.
    [J]. THEORETICAL COMPUTER SCIENCE, 2007, 373 (1-2) : 1 - 18
12345