Alternating two-way AC-tree automata

DOI10.1016/J.IC.2006.12.006MaRDI QIDQ2373699zbMATH OpenOpenAlexFDO

Authors Kumar Neeraj Verma, Jean Goubault-Larrecq

Publication date 16 July 2007

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2006.12.006

zbMATH Keywords

resolutiontree automatacryptographic protocolsalternating tree automataassociative-commutativebranching vector addition systems with statestwo-way tree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 2043529
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Combining Equational Tree Automata over AC and ACI Theories
• Tree automata with one memory set constraints and cryptographic protocols
• Alternating tree automata

Cites work

• scientific article; zbMATH DE number 1614701 (Why is no real title available?)
• scientific article; zbMATH DE number 3871322 (Why is no real title available?)
• scientific article; zbMATH DE number 44213 (Why is no real title available?)
• scientific article; zbMATH DE number 3615891 (Why is no real title available?)
• scientific article; zbMATH DE number 1051240 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 1948181 (Why is no real title available?)
• scientific article; zbMATH DE number 1956522 (Why is no real title available?)
• scientific article; zbMATH DE number 2043529 (Why is no real title available?)
• scientific article; zbMATH DE number 1487854 (Why is no real title available?)
• scientific article; zbMATH DE number 1747449 (Why is no real title available?)
• scientific article; zbMATH DE number 1754629 (Why is no real title available?)
• scientific article; zbMATH DE number 1765659 (Why is no real title available?)
• scientific article; zbMATH DE number 1765682 (Why is no real title available?)
• scientific article; zbMATH DE number 1841842 (Why is no real title available?)
• scientific article; zbMATH DE number 2090068 (Why is no real title available?)
• scientific article; zbMATH DE number 3254906 (Why is no real title available?)
• scientific article; zbMATH DE number 3413831 (Why is no real title available?)
• scientific article; zbMATH DE number 3415409 (Why is no real title available?)
• A Unification Algorithm for Associative-Commutative Functions
• A structure to decide reachability in Petri nets
• Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically
• Alternating tree automata
• Alternating two-way AC-tree automata
• An Algorithm for the General Petri Net Reachability Problem
• An Efficient Unification Algorithm
• Automata-driven automated induction
• Automated Deduction – CADE-20
• Automated reasoning. 1st international joint conference, IJCAR 2001, Siena, Italy, June 18-22, 2001. Proceedings
• Combining superposition, sorts and splitting
• Counter machines and verification problems.
• Equality and disequality constraints on direct subterms in tree automata
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Feature automata and recognizable sets of feature trees
• Ground reducibility is EXPTIME-complete
• Handbook of automated reasoning. In 2 vols
• Haskell overloading is DEXPTIME-complete
• Karp-Miller trees for a branching extension of VASS
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• New directions in cryptography
• On Context-Free Languages
• On closure under complementation of equational tree automata for theories extending AC
• On the reachability problem for 5-dimensional vector addition systems
• Parallel program schemata
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Resolution theorem proving
• Semigroups, Presburger formulas, and languages
• Solving a unification problem under constrained substitutions using tree automata
• Term Rewriting and Applications
• Tree automata help one to solve equational formulae in AC-theories
• Tree pushdown automata
• Well-structured transition systems everywhere!

Cited in

(12)

• Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 2043529 (Why is no real title available?)
• Complement for two-way alternating automata
• A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata
• Multitree automata that count
• Alternating two-way AC-tree automata
• Tree Automata for Non-linear Arithmetic
• Alternating tree automata
• Manipulating tree tuple languages by transforming logic programs
• Improved complement for two-way alternating automata
• Complement for two-way alternating automata

Describes a project that uses

Uses Software

• VAMPIRE

This page was built for publication: Alternating two-way AC-tree automata

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