scientific article; zbMATH DE number 2090067

zbMath1045.68076MaRDI QIDQ4808741

Hiroyuki Seki, Toshinori Takai, Yuichi Kaji, Youhei Fujinaka

Publication date: 12 August 2004

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items

Losing recognizability ⋮ Tree automata with equality constraints modulo equational theories ⋮ Tree automata for rewrite strategies ⋮ Decidable call-by-need computations in term rewriting ⋮ Reachability analysis over term rewriting systems ⋮ Termination criteria for tree automata completion ⋮ Bottom-up rewriting for words and terms