Layered transducing term rewriting system and its recognizability preserving property

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2378, Issue , 2002, Pages 98-113

  Seki, Hiroyuki ^a   Takai, Toshinori ^b   Fujinaka, Youhei ^a   Kaji, Yuichi ^a  

^a NARA INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

COMPUTATION MODEL; MATHEMATICAL PROPERTIES; REACHABILITY; TERM REWRITING SYSTEMS; TRANSDUCING; TREE LANGUAGES; TREE TRANSDUCERS;

COMPUTABILITY AND DECIDABILITY;

EID: 84947263345     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45610-4_8     Document Type: Conference Paper

References (15)

1. Baader, F. and Nipkow, T.: Term Rewriting and All That, Cambridge University Press, 1998.
2. Brained, W.S.: “Tree generating regular systems,” Inform. and control, 14, pp.217–231, 1969.
3. Coquidé, J.L., Dauchet, M., Gilleron, R. and Vágvölgyi, S.: “Bottom-up tree pushdown automata: classification and connection with rewrite systems,” Theoretical Computer Science, 127, pp.69–98, 1994.
4. Durand, I. and Middeldorp, A.: “Decidable call by need computations in term rewriting (extended abstract),” Proc. of CADE-14, North Queensland, Australia, LNAI 1249, pp.4–18, 1997.
5. Genet, T.: “Decidable approximations of sets of descendants and sets of normal forms,” Proc. of RTA98, Tsukuba, Japan, LNCS 1379, pp.151–165, 1998.
6. Gécseq, F. and Steinby, M.: Tree Automata, Académiai Kiadó, 1984.
7. Gilleron, R.: “Decision problems for term rewriting systems and recognizable tree languages,” Proc. of STACS’91, Hamburg, Germany, LNCS 480, pp.148–159, 1991.
8. Gilleron, R. and Tison, S.: “Regular tree languages and rewrite systems,” Fundamenta Informaticae, 24, pp.157–175, 1995.
9. Gyenizse, P. and Vágvölgyi, S.: “Linear generalized semi-monadic rewrite systems effectively preserve recognizability,” Theoretical Computer Science, 194, pp.87–122, 1998.
10. Jacquemard, F.:“Decidable approximations of term rewriting systems,” Proc. of RTA96, New Brunswick, NJ, LNCS 1103, pp.362–376, 1996.
11. Middeldorp, A.: “Approximating dependency graph using tree automata techniques,” Proc. of Int’l Joint Conf. on Automated Reasoning, LNAI 2083, pp.593–610, 2001.
12. Nagaya, T. and Toyama, Y.: “Decidability for left-linear growing term rewriting systems,” Proc. of RTA99, Trento, Italy, LNCS 1631, pp.256–270, 1999.
13. Réty, P.: “Regular sets of descendants for constructor-based rewrite systems,” Proc. of LPAR’99, Tbilisi, Georgia, LNCS 1705, pp.148–160, 1999.
14. Salomaa, K.: “Deterministic tree pushdown automata and monadic tree rewriting systems,” J. Comput. system Sci., 37, pp.367–394, 1988.
15. Takai, T., Kaji, Y. and Seki, H.: “Right-linear finite path overlapping term rewriting systems effectively preserve recognizability,” Proc. of RTA2000, Norwich, U.K., LNCS 1833, pp.246–260, 2000.