scientific article; zbMATH DE number 2090067

zbMATH Open1045.68076MaRDI QIDQ4808741FDOQ4808741

Authors: Hiroyuki Seki, Toshinori Takai, Youhei Fujinaka, Yuichi Kaji 

Publication date: 12 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2378/23780098.htm

Title of this publication is not available (Why is that?)

Recommendations

• Rewriting preserving recognizability of finite tree languages
• scientific article; zbMATH DE number 1615242
• scientific article
• Bottom-Up Rewriting Is Inverse Recognizability Preserving
• A property of left-linear rewrite systems preserving recognizability

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cited In (11)

• Decidable call-by-need computations in term rewriting
• A property of left-linear rewrite systems preserving recognizability
• Bottom-Up Rewriting Is Inverse Recognizability Preserving
• Rewriting preserving recognizability of finite tree languages
• Bottom-up rewriting for words and terms
• Losing recognizability
• Tree automata with equality constraints modulo equational theories
• Title not available (Why is that?)
• Reachability analysis over term rewriting systems
• Tree automata for rewrite strategies
• Termination criteria for tree automata completion

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808741)