Recognizing Boolean closed A-tree languages with membership conditional rewriting mechanism

DOI10.1007/3-540-44881-0_34MaRDI QIDQ4447253zbMATH OpenFDO

Authors Hitoshi Ohsaki, Hiroyuki Seki, Toshinori Takai

Publication date 16 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Recommendations

• Propositional Tree Automata
• scientific article; zbMATH DE number 480524
• Beyond regularity: Equational tree automata for associative and commutative theories
• Rigid Tree Automata
• Decidability and closure properties of equational tree languages

Cited in

(5)

• Generalized rewrite theories, coherence completion, and symbolic methods
• One-variable context-free hedge automata
• 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

This page was built for publication: Recognizing Boolean closed A-tree languages with membership conditional rewriting mechanism

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