International Journal of Foundations of Computer Science, Volume 26

Volume 26, Number 1, January 2015

• 
  Puwen Wei, Yuliang Zheng:
  On the Construction of Public Key Encryption with Sender Recovery. 1-32
• 
  Sanpawat Kantabutra:
  Fast Sequential and Parallel Vertex Relabelings of K_{m, m}. 33-50
• 
  Ratnik Gandhi, Samaresh Chatterji:
  Applications of Algebra for Some Game Theoretic Problems. 51-78
• 
  Jon M. Corson, Lance L. Ross:
  Automata with Counters that Recognize Word Problems of Free Products. 79-98
• 
  Uraz Cengiz Türker, Hüsnü Yenigün:
  Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata. 99-122
• 
  Wen Chean Teh:
  On Core Words and the Parikh Matrix Mapping. 123-142
• 
  Qunying Liao, Juan Zhu:
  A Note on Optimal Constant Dimension Codes. 143-152
• 
  Boris Ryabko:
  Complexity of Approximating Functions on Real-Life Computers. 153-158
• 
  Xianyong Li, Xiaofan Yang, Li He, Cui Yu, Jing Zhang:
  Conditional Fault Tolerance of Hypermesh Optical Interconnection Networks. 159-

Volume 26, Number 2, February 2015

• 
  Koji Nuida, Takuro Abe, Shizuo Kaji, Toshiaki Maeno, Yasuhide Numata:
  A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators. 169-194
• 
  Fatemeh Rajabi-Alni, Alireza Bagheri:
  Constrained Point Set Embedding of a Balanced Binary Tree. 195-210
• 
  Hae-Sung Eom, Yo-Sub Han, Kai Salomaa:
  State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages. 211-228
• 
  Yihua Ding, James Zijun Wang, Pradip K. Srimani:
  New Self-Stabilizing Algorithms for Minimal Weakly Connected Dominating Sets. 229-240
• 
  Kai Feng, Shiying Wang, Guozhen Zhang:
  Link Failure Tolerance in the Arrangement Graphs. 241-254
• 
  Stephen A. Fenner, Yong Zhang:
  Quantum Algorithms for a Set of Group Theoretic Problems. 255-268
• 
  Tina M. Kouri, Daniel Pascua, Dinesh P. Mehta:
  Random Models and Analyses for Chemical Graphs. 269-

Volume 26, Number 3, April 2015

• 
  Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita:
  Weak vs. Self vs. Probabilistic Stabilization. 293-320
• 
  Subrata Saha, Sanguthevar Rajasekaran, Rampi Ramprasad:
  Novel Randomized Feature Selection Algorithms. 321-342
• 
  Eric Rowland, Jeffrey Shallit:
  Automatic Sets of Rational Numbers. 343-366
• 
  Xingqin Qi, Edgar Fuller, Rong Luo, Guodong Guo, Cun-Quan Zhang:
  Laplacian Energy of Digraphs and a Minimum Laplacian Energy Algorithm. 367-380
• 
  Jozef Gruska, Daowen Qiu, Shenggen Zheng:
  Potential of Quantum Finite Automata with Exact Acceptance. 381-398
• 
  Alexander Grigoriev, Bert Marchal, Natalya Usotskaya:
  A Note on the Minimum H-Subgraph Edge Deletion. 399-412

Volume 26, Number 4, June 2015

• 
  Joan Boyar, Kim S. Larsen, Abyayananda Maiti:
  The Frequent Items Problem in Online Streaming Under Various Performance Measures. 413-440
• 
  Jaroslaw Rudy:
  Dynamic Random-Access Stored-Program Machine for Runtime Code Modification. 441-464
• 
  Cristian S. Calude, Damien Desfontaines:
  Anytime Algorithms for Non-Ending Computations. 465-476
• 
  Jan Christensen, Anders Nicolai Knudsen, Kim S. Larsen:
  Soccer is Harder Than Football. 477-486
• 
  Xishun Zhu, Xiangyong Zeng, Yuan Chen:
  Some Binomial and Trinomial Differentially 4-Uniform Permutation Polynomials. 487-498
• 
  Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro:
  Shortest, Fastest, and Foremost Broadcast in Dynamic Networks. 499-522
• 
  Tiziana Calamoneri:
  Optimal L(j, k)-Edge-Labeling of Regular Grids. 523-535

Volume 26, Number 5, August 2015

• 
  Arto Salomaa, Francis Y. L. Chin, Oscar H. Ibarra, Sartaj Sahni:
  Alberto Apostolico.
• 
  Xiwang Cao, Lei Hu:
  Two Boolean Functions with Five-Valued Walsh Spectra and High Nonlinearity. 537-556
• 
  Thomas O'Neil:
  Complement, Complexity, and Symmetric Representation. 557-582
• 
  Shiying Wang, Kai Feng, Yubao Guo:
  Sufficient Conditions for Maximally k-Isoperimetric Edge Connectivity of Graphs. 583-598
• 
  Guangkui Xu, Xiwang Cao:
  Constructing New Piecewise Differentially 4-Uniform Permutations from Known APN Functions. 599-610
• 
  Tzu-Hsin Ho, Li-Hsing Yen, Chien-Chao Tseng:
  Simple-Yet-Efficient Construction and Revocation of Group Signatures. 611-624
• 
  Abdullah N. Arslan:
  Fast Algorithms for Local Similarity Queries in Two Sequences. 625-642
• 
  Friedrich Otto:
  Asynchronous Parallel Communicating Systems of Pushdown Automata. 643-

Volume 26, Number 6, September 2015

• 
  Aysun Ozan Aytaç, Tufan Turaci:
  Vulnerability Measures of Transformation Graph G^xy+. 667-676
• 
  Jan van Leeuwen, Jirí Wiedermann:
  Separating the Classes of Recursively Enumerable Languages Based on Machine Size. 677-696
• 
  Hae-Sung Eom, Yo-Sub Han:
  State Complexity of Boundary of Prefix-Free Regular Languages. 697-708
• 
  Zbynek Krivka, Alexander Meduna:
  Jumping Grammars. 709-732
• 
  Laura Giambruno, Sabrina Mantaci, Jean Néraud, Carla Selmi:
  A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay. 733-750
• 
  Brahim Neggazi, Nabil Guellati, Mohammed Haddad, Hamamache Kheddouci:
  Efficient Self-Stabilizing Algorithm for Independent Strong Dominating Sets in Arbitrary Graphs. 751-768
• 
  Javad Akbari Torkestani:
  Algorithms for Steiner Connected Dominating Set Problem Based on Learning Automata Theory. 769-

Volume 26, Number 7, November 2015

Special Issue - Implementation and Application of Automata (CIAA 2014)

• 
  Markus Holzer, Martin Kutrib:
  Preface. 803-804
• 
  Javier Esparza, Michael Luttenberger, Maximilian Schlund:
  FPSOLVE: A Generic Solver for Fixpoint Equations Over Semirings. 805-826
• 
  Giovanni Pighizzini:
  Investigations on Automata and Languages Over a Unary Alphabet. 827-850
• 
  Georgios Ch. Sirakoulis:
  The Computational Paradigm of Cellular Automata in Crowd Evacuation. 851-872
• 
  Ivone Amorim, António Machiavelo, Rogério Reis:
  On the Number of Linear Finite Transducers. 873-894
• 
  Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano:
  On the Power of One-Way Automata with Quantum and Classical States. 895-912
• 
  Janusz A. Brzozowski, Marek Szykula:
  Large Aperiodic Semigroups. 913-932
• 
  Marius Dumitran, Javier Gil, Florin Manea, Victor Mitrana:
  Bounded Prefix-Suffix Duplication: Language Theoretic and Algorithmic Results. 933-952
• 
  Vladimir V. Gusev, Elena V. Pribavkina:
  Reset Thresholds of Automata with Two Cycle Lengths. 953-966
• 
  Oscar H. Ibarra:
  On the Ambiguity and Finite-Valuedness Problems in Acceptors and Transducers. 967-986
• 
  Andreas Maletti:
  The Power of Weighted Regularity-Preserving Multi Bottom-Up Tree Transducers. 987-

Volume 26, Number 8, December 2015

Special Issue - Automata and Formal Languages (AFL 2014)

• 
  Zoltán Ésik:
  Preface. 1007-1008
• 
  Hermann Gruber, Markus Holzer:
  From Finite Automata to Regular Expressions and Back - A Summary on Descriptional Complexity. 1009-1040
• 
  Christof Löding:
  Simplification Problems for Deterministic Pushdown Automata on Infinite Words. 1041-1068
• 
  Sebastian Maneth:
  A Survey on Decidable Equivalence Problems for Tree Transducers. 1069-1100
• 
  Henning Bordihn, Martin Kutrib, Andreas Malcher:
  Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities. 1101-1126
• 
  Vincent Carnino, Sylvain Lombardy:
  On Determinism and Unambiguity of Weighted Two-Way Automata. 1127-1146
• 
  Chen Fei Du, Jeffrey Shallit, Arseny M. Shur:
  Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words. 1147-1166
• 
  Henning Fernau, Rudolf Freund, Markus Holzer:
  The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems. 1167-1188

Erratum

• 
  Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk:
  Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL^⋆. 1189-