Journal: Int. J. Comput. Math.

Volume 90, Issue 6

1129 -- 1131Shunsuke Inenaga, Carlos Martín-Vide. Foreword
1132 -- 1149Dana Angluin, James Aspnes, Raonne Barbosa Vargas. Mutation systems
1150 -- 1170Witold Charatonik, Agata Chorowska. Parameterized complexity of basic decision problems for tree automata
1171 -- 1196Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey Shallit. Composition and orbits of language operations: finiteness and upper bounds
1197 -- 1222Ruth Corran, Michael Hoffmann 0002, Dietrich Kuske, Richard M. Thomas. On the automaticity of singular Artin monoids of finite type
1223 -- 1246Martin Huschenbett. Models for quantitative distributed systems and multi-valued logics
1247 -- 1253Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell. Unique subgraphs are not easier to find
1254 -- 1277Benedek Nagy, Friedrich Otto. Globally deterministic CD-systems of stateless R-automata with window size 1
1278 -- 1291Alberto Policriti, Alexandru I. Tomescu. Well-quasi-ordering hereditarily finite sets
1292 -- 1309Daniel Reidenbach, Markus L. Schmid. Finding shuffle words that represent optimal scheduling of shared memory access
1310 -- 1320Arto Salomaa, Kai Salomaa, Sheng Yu. Undecidability of state complexity