Presentation 1999/11/12
Homomorphisms Theorem and Unreachability for ω Rewriting Systems
Kiyoshi Akama, Yoshinori Shigeta, Eiichi Miyamoto,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) An abstract structure called ω structure is used to formalize the concepts of "substitutions," "contexts," and "replacement" common to many rewriting systems. A class of rewriting systems, called ω rewriting systems, has been defined on ω structures and includes very important systems such as term rewriting systems, string rewriting systems, and Petri Nets. In this paper, we introduce a concept of homomorphism for ω rewriting systems and prove a homomorphism theorem for ω rewriting systems. We also explain how to apply the homomorphism theorem to solve unreachability problems for ω rewriting systems.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) rewriting system / homomorphism / homomorphism theorem / unreachability
Paper # KBSE99-40
Date of Issue

Conference Information
Committee KBSE
Conference Date 1999/11/12(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Knowledge-Based Software Engineering (KBSE)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Homomorphisms Theorem and Unreachability for ω Rewriting Systems
Sub Title (in English)
Keyword(1) rewriting system
Keyword(2) homomorphism
Keyword(3) homomorphism theorem
Keyword(4) unreachability
1st Author's Name Kiyoshi Akama
1st Author's Affiliation Division of System and Information Engineering, Hokkaido University()
2nd Author's Name Yoshinori Shigeta
2nd Author's Affiliation Division of System and Information Engineering, Hokkaido University
3rd Author's Name Eiichi Miyamoto
3rd Author's Affiliation Division of System and Information Engineering, Hokkaido University
Date 1999/11/12
Paper # KBSE99-40
Volume (vol) vol.99
Number (no) 426
Page pp.pp.-
#Pages 8
Date of Issue