Alternating two-way AC-tree automata
From MaRDI portal
Publication:2373699
DOI10.1016/J.IC.2006.12.006zbMATH Open1118.68081OpenAlexW2092010284MaRDI QIDQ2373699FDOQ2373699
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
Recommendations
resolutiontree automatacryptographic protocolsalternating tree automataassociative-commutativebranching vector addition systems with statestwo-way tree automata
Cites Work
- Title not available (Why is that?)
- Semigroups, Presburger formulas, and languages
- Parallel program schemata
- Resolution theorem proving
- New directions in cryptography
- Title not available (Why is that?)
- On Context-Free Languages
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- An Efficient Unification Algorithm
- Combining superposition, sorts and splitting
- Title not available (Why is that?)
- A Unification Algorithm for Associative-Commutative Functions
- Title not available (Why is that?)
- Well-structured transition systems everywhere!
- On the reachability problem for 5-dimensional vector addition systems
- A structure to decide reachability in Petri nets
- Title not available (Why is that?)
- Automated reasoning. 1st international joint conference, IJCAR 2001, Siena, Italy, June 18-22, 2001. Proceedings
- Title not available (Why is that?)
- Equality and disequality constraints on direct subterms in tree automata
- Title not available (Why is that?)
- Counter machines and verification problems.
- An Algorithm for the General Petri Net Reachability Problem
- Automated Deduction – CADE-20
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Handbook of automated reasoning. In 2 vols
- Karp-Miller trees for a branching extension of VASS
- Automata-driven automated induction
- Ground reducibility is EXPTIME-complete
- Alternating tree automata
- Title not available (Why is that?)
- Feature automata and recognizable sets of feature trees
- Term Rewriting and Applications
- Haskell overloading is DEXPTIME-complete
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tree automata help one to solve equational formulae in AC-theories
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tree pushdown automata
- Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically
- Alternating two-way AC-tree automata
- Solving a unification problem under constrained substitutions using tree automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On closure under complementation of equational tree automata for theories extending AC
- Title not available (Why is that?)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
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
- Title not available (Why is that?)
- 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
Uses Software
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)
