Abstract is missing.
- Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite SystemsAart Middeldorp, Georg Moser, Friedrich Neurauter, Johannes Waldmann, Harald Zankl. 1-20 [doi]
- From Grammars and Automata to Algebras and CoalgebrasPeter Padawitz. 21-43 [doi]
- Theme and Variations on the Concatenation ProductJean-Éric Pin. 44-64 [doi]
- Some Combinatorial Applications of Gröbner BasesLajos Rónyai, Tamás Mészáros. 65-83 [doi]
- Comparing Necessary Conditions for Recognizability of Two-Dimensional LanguagesMarcella Anselmo, Maria Madonia. 84-96 [doi]
- Typed Monoids - An Eilenberg-Like Theorem for Non Regular LanguagesChristoph Behle, Andreas Krebs, Stephanie Reifferscheid. 97-114 [doi]
- Codes and Combinatorial Structures from Circular Planar NearringsAnna Benini, Achille Frigeri, Fiorenza Morini. 115-126 [doi]
- Independence of Hyperlogarithms over Function Fields via Algebraic CombinatoricsMatthieu Deneufchåtel, Gérard Duchamp, Vincel Hoang Ngoc Minh, Allan I. Solomon. 127-139 [doi]
- Quantifier Elimination over Finite Fields Using Gröbner BasesSicun Gao, André Platzer, Edmund M. Clarke. 140-157 [doi]
- /mathbb ::::F::::/mathbb F-Rank-Width of (Edge-Colored) GraphsMamadou Moustapha Kanté, Michaël Rao. 158-173 [doi]
- An Algorithm for Computing a Basis of a Finite Abelian GroupGregory Karagiorgos, Dimitrios Poulakis. 174-184 [doi]
- Rewriting in Varieties of Idempotent SemigroupsOndrej Klíma, Miroslav Korbelár, Libor Polák. 185-200 [doi]
- Simplifying Algebraic Functional SystemsCynthia Kop. 201-215 [doi]
- Hadamard Matrices, Designs and Their Secret-Sharing SchemesChristos Koukouvinos, Dimitris E. Simos, Zlatko Varbanov. 216-229 [doi]
- I-RiSC: An SMT-Compliant Solver for the Existential Fragment of Real AlgebraUlrich Loup, Erika Ábrahám. 230-246 [doi]
- Variable Tree Automata over Infinite Ranked AlphabetsIrini-Eleftheria Mens, George Rahonis. 247-260 [doi]