Algebraic Informatics

4th International Conference, CAI 2011, Linz, Austria, June 21-24, 2011. Proceedings

  • Franz Winkler
Conference proceedings CAI 2011

DOI: 10.1007/978-3-642-21493-6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6742)

Table of contents (16 papers)

  1. Front Matter
  2. Invited Papers

    1. Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems
      Aart Middeldorp, Georg Moser, Friedrich Neurauter, Johannes Waldmann, Harald Zankl
      Pages 1-20
    2. Some Combinatorial Applications of Gröbner Bases
      Lajos Rónyai, Tamás Mészáros
      Pages 65-83
  3. Contributed Papers

    1. Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages
      Christoph Behle, Andreas Krebs, Stephanie Reifferscheid
      Pages 97-114
    2. Codes and Combinatorial Structures from Circular Planar Nearrings
      Anna Benini, Achille Frigeri, Fiorenza Morini
      Pages 115-126
    3. Independence of Hyperlogarithms over Function Fields via Algebraic Combinatorics
      Matthieu Deneufchâtel, Gérard H. E. Duchamp, Vincel Hoang Ngoc Minh, Allan I. Solomon
      Pages 127-139
    4. Quantifier Elimination over Finite Fields Using Gröbner Bases
      Sicun Gao, André Platzer, Edmund M. Clarke
      Pages 140-157
    5. \(\mathbb F\)-Rank-Width of (Edge-Colored) Graphs
      Mamadou Moustapha Kanté, Michael Rao
      Pages 158-173
    6. An Algorithm for Computing a Basis of a Finite Abelian Group
      Gregory Karagiorgos, Dimitrios Poulakis
      Pages 174-184
    7. Rewriting in Varieties of Idempotent Semigroups
      Ondřej Klíma, Miroslav Korbelář, Libor Polák
      Pages 185-200
    8. Simplifying Algebraic Functional Systems
      Cynthia Kop
      Pages 201-215
    9. Hadamard Matrices, Designs and Their Secret-Sharing Schemes
      Christos Koukouvinos, Dimitris E. Simos, Zlatko Varbanov
      Pages 216-229
    10. Variable Tree Automata over Infinite Ranked Alphabets
      Irini-Eleftheria Mens, George Rahonis
      Pages 247-260
  4. Back Matter

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 4th International Conference on Algebraic Informatics, CAI 2011, held in Linz, Austria, in June 2011.

The 12 revised full papers presented together with 4 invited articles were carefully reviewed and selected from numerous submissions. The papers cover topics such as algebraic semantics on graph and trees, formal power series, syntactic objects, algebraic picture processing, finite and infinite computations, acceptors and transducers for strings, trees, graphs arrays, etc. decision problems, algebraic characterization of logical theories, process algebra, algebraic algorithms, algebraic coding theory, and algebraic aspects of cryptography.

Keywords

Groebner bases algebraic groups automata theory comma codes complexity theory grammar systems semigroups

Editors and affiliations

  • Franz Winkler
    • 1
  1. 1.Research Institute for Symbolic Computation (RISC)Johannes Kepler UniversityLinzAustria

Bibliographic information

  • Copyright Information Springer Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-21492-9
  • Online ISBN 978-3-642-21493-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349