scientific article; zbMATH DE number 2043529

MaRDI QIDQ4447233zbMATH OpenFDO

Authors Kumar Neeraj Verma

Publication date 16 February 2004

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

zbMATH Keywords

equational theoriesemptinessalternationtwo-way tree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42) Decidability of theories and sets of sentences (03B25)

Recommendations

• On closure under complementation of equational tree automata for theories extending AC
• Combining Equational Tree Automata over AC and ACI Theories
• Tree automata help one to solve equational formulae in AC-theories
• scientific article; zbMATH DE number 2090068
• Tree Automata with Equality Constraints Modulo Equational Theories
• Tree automata with equality constraints modulo equational theories
• scientific article; zbMATH DE number 1841842
• scientific article; zbMATH DE number 512857
• Alternating two-way AC-tree automata
• A survey on decidable equivalence problems for tree transducers

Cited in

(10)

• scientific article; zbMATH DE number 2090068 (Why is no real title available?)
• Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Multitree automata that count
• Alternating two-way AC-tree automata
• On closure under complementation of equational tree automata for theories extending AC
• Combining Equational Tree Automata over AC and ACI Theories
• Tree automata with equality constraints modulo equational theories
• Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case
• Monotone AC-Tree 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 Q4447233)