scientific article; zbMATH DE number 5708984

MaRDI QIDQ3559957zbMATH OpenFDO

Authors Toshinori Takai, Yuichi Kaji, Hiroyuki Seki

Publication date 17 May 2010

Full work available at URL http://www.jams.or.jp/scm/abstract/e-2010/2010-1a.txt

zbMATH Keywords

preserving recognizabilityterm rewriting systemtree automaton

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1615242
• A property of left-linear rewrite systems preserving recognizability
• Linear generalized semi-monadic rewrite systems effectively preserve recognizability
• Computer Science Logic
• Rewriting preserving recognizability of finite tree languages
• Right-linear half-monadic term rewrite systems
• Foundations of Software Science and Computational Structures
• Automated Deduction – CADE-20
• Existence, Uniqueness, and Construction of Rewrite Systems
• Strictly orthogonal left linear rewrite systems and primitive recursion

Cited in

(6)

• Linear generalized semi-monadic rewrite systems effectively preserve recognizability
• A property of left-linear rewrite systems preserving recognizability
• Rewriting preserving recognizability of finite tree languages
• scientific article; zbMATH DE number 1615242 (Why is no real title available?)
• scientific article; zbMATH DE number 2090067 (Why is no real title available?)
• Bottom-up rewriting for words and terms

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 Q3559957)