On closure under complementation of equational treeautomata for theories extending AC

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2850, Issue , 2003, Pages 183-197

  Verma, Kumar Neeraj ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BOOLEAN ALGEBRA; CRYPTOGRAPHY; FUNCTIONS; MATHEMATICAL OPERATORS; PROBLEM SOLVING; RECURSIVE FUNCTIONS; ALGEBRA; ARTIFICIAL INTELLIGENCE; GROUP THEORY;

BOOLEAN OPERATIONS; CRYPTOGRAPHIC PROTOCOLS; TREE AUTOMATA;

TREES (MATHEMATICS); AUTOMATA THEORY;

ABELIAN GROUP; COMMUTATIVE MONOIDS; COMPLEMENTATION; EQUATIONAL THEORY; EXCLUSIVE-OR; IDEMPOTENT; TWO-WAY AUTOMATA; TWO-WAY TREE AUTOMATON;

EID: 9444253566     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-39813-4_12     Document Type: Conference Paper

References (18)

1. T. Colcombet. Rewriting in the partial algebra of typed terms modulo AC. In Electronic Notes in Theoretical Computer Science, volume 68. Elsevier Science Publishers, 2002.
2. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. www.grappa.univ-lille3.fr/tata, 1997.
3. W. Diffie and M. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644-654, 1976.
4. F. Gécseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 1-68. Springer Verlag, 1997.
5. S. Ginsburg and E. H. Spanier. Semigroups, Presburger formulas and languages. Pacific Journal of Mathematics, 16(2):285-296, 1966.
6. J. Goubault-Larrecq. A method for automatic cryptographic protocol verification. In FMPPTA'2000, 15th IPDPSWorkshops, pages 977-984. Springer-Verlag LNCS 1800, 2000.
7. J. Goubault-Larrecq and K. N.Verma. Alternating two-wayAC-tree automata. In preparation.
8. M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19 & 20:583-628, 1994.
9. D. Lugiez. A good class of tree automata. Application to inductive theorem proving. In ICALP'98, pages 409-420. Springer-Verlag LNCS 1443, 1998.
10. D. Lugiez. Counting and equality constraints for multitree automata. In FOSSACS'03, pages 328-342. Springer-Verlag LNCS 2620, 2003.
11. D. Monniaux. Abstracting cryptographic protocols with tree automata. In SAS'99, pages 149-163. Springer-Verlag LNCS 1694, 1999.
12. H. Ohsaki. Beyond regularity: Equational tree automata for associative and commutative theories. In CSL'01, pages 539-553. Springer-Verlag LNCS 2142, 2001.
13. H. Ohsaki and T. Takai. Decidability and closure properties of equational tree languages. In RTA'02, pages 114-128. Springer-Verlag LNCS 2378, 2002.
14. L. C. Paulson. Mechanized proofs for a recursive authentication protocol. In 10th IEEE Computer Security Foundations Workshop, pages 84-95, 1997.
15. P. Ryan and S. Schneider. An attack on a recursive authentication protocol: A cautionary tale. Information Processing Letters, 65(1):7-10, 1998.
16. M. Steiner, G. Tsudik, and M. Waidner. Key agreement in dynamic peer groups. IEEE Transactions on Parallel and Distributed Systems, 11(8):769-780, 2000.
17. M. Y. Vardi. Reasoning about the past with two-way automata. In ICALP'98, pages 628-641. Springer Verlag LNCS 1443, 1998.
18. K. N. Verma. Two-way equational tree automata for AC-like theories: Decidability and closure properties. In RTA'03, pages 180-196. Springer Verlag LNCS 2706, 2003.