Propositional Tree Automata

DOI10.1007/11805618_5MaRDI QIDQ3527283zbMATH OpenOpenAlexFDO

Authors Joe Hendrix, Hitoshi Ohsaki, Mahesh Viswanathan

Publication date 25 September 2008

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

Full work available at URL https://doi.org/10.1007/11805618_5

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Beyond regularity: Equational tree automata for associative and commutative theories
• Tree Automata with Equality Constraints Modulo Equational Theories
• Tree automata with equality constraints modulo equational theories
• Decidability and closure properties of equational tree languages
• Symbolic tree automata

Cited in

(5)

• Twenty years of rewriting logic
• Tree Automata with Equality Constraints Modulo Equational Theories
• Prolog infinite trees and automata
• Recognizing Boolean closed A-tree languages with membership conditional rewriting mechanism
• Beyond regularity: Equational tree automata for associative and commutative theories

Describes a project that uses

Uses Software

• AVISPA

This page was built for publication: Propositional Tree Automata

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