Foreword

References

• Angluin , D. , Aspnes , J. and Barbosa Vargas , R. 2013 . Mutation systems . Int. J. Comput. Math. , 90 ( 6 ) : 1132 – 1149 .
   Web of Science ®Google Scholar
• Charatonik , W. and Chorowska , A. 2013 . Parameterized complexity of basic decision problems for tree automata . Int. J. Comput. Math. , 90 ( 6 ) : 1150 – 1170 .
   Web of Science ®Google Scholar
• Charlier , É. , Domaratzki , M. , Harju , T. and Shallit , J. 2013 . Composition and orbits of language operations: finiteness and upper bounds . Int. J. Comput. Math. , 90 ( 6 ) : 1171 – 1196 .
   Web of Science ®Google Scholar
• Corran , R. , Hoffmann , M. , Kuske , D. and Thomas , R. M. 2013 . On the automaticity of singular Artin monoids of finite type . Int. J. Comput. Math. , 90 ( 6 ) : 1197 – 1222 .
   Web of Science ®Google Scholar
• Huschenbett , M. 2013 . Models for quantitative distributed systems and multi-valued logics . Int. J. Comput. Math. , 90 ( 6 ) : 1223 – 1246 .
   Web of Science ®Google Scholar
• Kowaluk , M. , Lingas , A. and Lundell , E.-M. 2013 . Unique subgraphs are not easier to find . Int. J. Comput. Math. , 90 ( 6 ) : 1247 – 1253 .
   Web of Science ®Google Scholar
• Nagy , B. and Otto , F. 2013 . Globally deterministic CD-systems of stateless R-automata with window size 1 . Int. J. Comput. Math. , 90 ( 6 ) : 1254 – 1277 .
   Web of Science ®Google Scholar
• Policriti , A. and Tomescu , A. I. 2013 . Well-quasi-ordering hereditarily finite sets . Int. J. Comput. Math. , 90 ( 6 ) : 1278 – 1291 .
   Web of Science ®Google Scholar
• Reidenbach , D. and Schmid , M. L. 2013 . Finding shuffle words that represent optimal scheduling of shared memory access . Int. J. Comput. Math. , 90 ( 6 ) : 1292 – 1309 .
   Web of Science ®Google Scholar
• Salomaa , A. , Salomaa , K. and Yu , S. 2013 . Undecidability of state complexity . Int. J. Comput. Math. , 90 ( 6 ) : 1310 – 1320 .
   Web of Science ®Google Scholar