default search action
4. CAI 2011: Linz, Austria
- Franz Winkler:
Algebraic Informatics - 4th International Conference, CAI 2011, Linz, Austria, June 21-24, 2011. Proceedings. Lecture Notes in Computer Science 6742, Springer 2011, ISBN 978-3-642-21492-9
Invited Papers
- Aart Middeldorp, Georg Moser, Friedrich Neurauter, Johannes Waldmann, Harald Zankl:
Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems. 1-20 - Peter Padawitz:
From Grammars and Automata to Algebras and Coalgebras. 21-43 - Jean-Éric Pin:
Theme and Variations on the Concatenation Product. 44-64 - Lajos Rónyai, Tamás Mészáros:
Some Combinatorial Applications of Gröbner Bases. 65-83
Contributed Papers
- Marcella Anselmo, Maria Madonia:
Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages. 84-96 - Christoph Behle, Andreas Krebs, Stephanie Reifferscheid:
Typed Monoids - An Eilenberg-Like Theorem for Non Regular Languages. 97-114 - Anna Benini, Achille Frigeri, Fiorenza Morini:
Codes and Combinatorial Structures from Circular Planar Nearrings. 115-126 - Matthieu Deneufchâtel, Gérard Duchamp, Vincel Hoang Ngoc Minh, Allan I. Solomon:
Independence of Hyperlogarithms over Function Fields via Algebraic Combinatorics. 127-139 - Sicun Gao, André Platzer, Edmund M. Clarke:
Quantifier Elimination over Finite Fields Using Gröbner Bases. 140-157 - Mamadou Moustapha Kanté, Michaël Rao:
\mathbb F\mathbb F-Rank-Width of (Edge-Colored) Graphs. 158-173 - Gregory Karagiorgos, Dimitrios Poulakis:
An Algorithm for Computing a Basis of a Finite Abelian Group. 174-184 - Ondrej Klíma, Miroslav Korbelár, Libor Polák:
Rewriting in Varieties of Idempotent Semigroups. 185-200 - Cynthia Kop:
Simplifying Algebraic Functional Systems. 201-215 - Christos Koukouvinos, Dimitris E. Simos, Zlatko Varbanov:
Hadamard Matrices, Designs and Their Secret-Sharing Schemes. 216-229 - Ulrich Loup, Erika Ábrahám:
I-RiSC: An SMT-Compliant Solver for the Existential Fragment of Real Algebra. 230-246 - Irini-Eleftheria Mens, George Rahonis:
Variable Tree Automata over Infinite Ranked Alphabets. 247-260
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.