Sommaire du Fascicule no. 1

Special issue dedicated to the 15th "Journées Montoises d'Informatique Théorique"

Foreword - Special issue dedicated to the fifteenth “Journées Montoises d’Informatique Théorique”
Reduction in non-(k+1)-power-free morphisms
An isolated point in the Heinis spectrum
Decision algorithms for Fibonacci-automatic Words, I: Basic results
Digital semigroups
Cross-bifix-free sets generation via Motzkin paths
On digital blocks of polynomial values and extractions in the Rudin–Shapiro sequence
A short proof that shuffle squares are 7-avoidable
Tilings by 1×1 and 2×2

Sommaire du Fascicule no. 2

Computing Depths of Patterns
The average lower reinforcement number of a graph
Delay Games with WMSO+U Winning Conditions
Note on occurrences of factors in circular words
Advice complexity of disjoint path allocation

Sommaire du Fascicule no. 3

Traceable Identity-Based Group Signature
Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems
A novel image encryption algorithm based on the extracted map of overlapping paths from the secret key
Kleene closure and state complexity
The average scattering number of graphs

Sommaire du Fascicule no. 4

7th Non-Classical Models of Automata and Applications (NCMA-2015)

Preface: Non-Classical Models of Automata and Applications VII
Input- or output-unary sweeping transducers are weaker than their 2-way counterparts
A pumping lemma for flip-pushdown languages
When input-driven pushdown automata meet reversiblity
Two-way representations and weighted automata
Some classes of rational functions for pictures
Homing vector automata