scientific article; zbMATH DE number 2043549

MaRDI QIDQ4447253zbMATH OpenFDO

Authors Hitoshi Ohsaki, Hiroyuki Seki, Toshinori Takai

Publication date 16 February 2004

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

Mathematics Subject Classification ID

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

Recommendations

• Propositional Tree Automata
• scientific article; zbMATH DE number 480524
• scientific article; zbMATH DE number 1841842
• Rigid Tree Automata
• scientific article; zbMATH DE number 2090068

Cited in

(5)

• Generalized rewrite theories, coherence completion, and symbolic methods
• Narrowing and rewriting logic: from foundations to applications
• Tree Automata for Non-linear Arithmetic
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• One-variable context-free hedge automata

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