FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

DOI10.1007/B104325MaRDI QIDQ5465883zbMATH OpenOpenAlexFDO

Authors Kumar Neeraj Verma

Publication date 12 August 2005

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Cryptography (94A60)

Recommendations

• Alternating two-way AC-tree automata
• scientific article; zbMATH DE number 2043529
• Combining Equational Tree Automata over AC and ACI Theories
• Tree automata with one memory set constraints and cryptographic protocols
• On closure under complementation of equational tree automata for theories extending AC

Cited in

(2)

• Alternating two-way AC-tree automata
• Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case

This page was built for publication: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

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