scientific article; zbMATH DE number 2090067

MaRDI QIDQ4808741zbMATH OpenFDO

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

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(11)

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

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)