Algebraic Informatics

6th International Conference, CAI 2015, Stuttgart, Germany, September 1-4, 2015. Proceedings
Herausgegeben:Maletti, Andreas

• Broschiertes Buch

Produktbeschreibung

This book constitutes the refereed proceedings of the 6th International Conference on Algebraic Informatics, CAI 2015, held in Stuttgart, Germany, in September 2015.

The 15 revised full papers presented were carefully reviewed and selected from 25 submissions. The papers cover topics such as data models and coding theory; fundamental aspects of cryptography and security; algebraic and stochastic models of computing; logic and program modelling.

Produktdetails

• Theoretical Computer Science and General Issues 9270
• Verlag: Springer / Springer International Publishing / Springer, Berlin
• Artikelnr. des Verlages: 978-3-319-23020-7
• 1st ed. 2015
• Seitenzahl: 232
• Erscheinungstermin: 12. August 2015
• Englisch
• Abmessung: 235mm x 155mm x 13mm
• Gewicht: 359g
• ISBN-13: 9783319230207
• ISBN-10: 3319230204
• Artikelnr.: 43231647

Autorenporträt

Inhaltsangabe

Learning Weighted Automata.- More Than 1700 Years of Word Equations.- An Algebraic Geometric Approach to Multidimensional Words.- Why We Need Semirings in Automata Theory.- Unbordered Pictures: Properties and Construction.- Effective Invariant Theory of Permutation Groups using Representation Theory.- On differential uniformity of maps that may hide an algebraic trapdoor.- On the Lower Block Triangular Nature of the Incidence Matrices to Compute the Algebraic Immunity of Boolean Functions.- Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics.- A New Partial Key Exposure Attack on Multi-power RSA.- A Chomsky-Schutzenberger Theorem for Weighted Automata with Storage.- EF+EX Forest Algebras.- On near prime-order elliptic curves with small embedding degrees.- Key-Policy Multi-Authority Attribute-Based Encryption.- Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree.- Complexity of Uniform Membership of Context-Free Tree Grammars.- Attacking BEAR and LION schemes in a realistic scenario.- Weighted Restarting Automata and Pushdown Relations.- Equivalence checking problem for finite state transducers over semigroups.