default search action
RAIRO - Theoretical Informatics and Applications, Volume 50
Volume 50, Number 1, January - March 2016
- Damien Jamet:
Foreword - Special issue dedicated to the fifteenth "Journées Montoises d'Informatique Théorique". 1 - Francis Wlazinski:
Reduction in non-(k + 1)-power-free morphisms. 3-20 - Ramzi Turki:
An isolated point in the Heinis spectrum. 21-38 - Hamoon Mousavi, Luke Schaeffer, Jeffrey O. Shallit:
Decision algorithms for Fibonacci-automatic Words, I: Basic results. 39-66 - Horst Brunotte:
Digital semigroups. 67-79 - Elena Barcucci, Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Jonathan Succi:
Cross-bifix-free sets generation via Motzkin paths. 81-91 - Thomas Stoll:
On digital blocks of polynomial values and extractions in the Rudin-Shapiro sequence. 93-99 - Guillaume Guégan, Pascal Ochem:
A short proof that shuffle squares are 7-avoidable. 101-103 - Nicolas Rolin, Alexandra Ugolnikova:
Tilings by 1 × 1 and 2 × 2. 105-116
Volume 50, Number 2, 2016
- Francine Blanchet-Sadri, Andrew Lohr:
Computing Depths of Patterns. 117-133 - Tufan Turaci, Ersin Aslan:
The average lower reinforcement number of a graph. 135-144 - Martin Zimmermann:
Delay Games with WMSO+U Winning Conditions. 145-165 - Pierre Arnoux:
Note on occurrences of factors in circular words. 167-170 - Ivana Kovácová:
Advice complexity of disjoint path allocation. 171-191
Volume 50, Number 3, 2016
- Ke Gu, Lihao Yang, Yong Wang, Sheng Wen:
Traceable Identity-Based Group Signature. 193-226 - Édouard Bonnet, Vangelis Th. Paschos, Florian Sikora:
Parameterized exact and approximation algorithms for maximum k-set cover and related satisfiability problems. 227-240 - Mohammed Abbas Fadhil Al-Husainy:
A novel image encryption algorithm based on the extracted map of overlapping paths from the secret key. 241-249 - Matús Palmovský:
Kleene closure and state complexity. 251-261 - Ersin Aslan, Deniz Kilinç, Fatih Yücalar, Emin Borandag:
The average scattering number of graphs. 263-272
Volume 50, Number 4, October - December 2016
- Preface: Non-Classical Models of Automata and Applications VII. 273-274
- Bruno Guillon:
Input- or output-unary sweeping transducers are weaker than their 2-way counterparts. 275-294 - Peter Kostolányi:
A pumping lemma for flip-pushdown languages. 295-311 - Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
When input-driven pushdown automata meet reversiblity. 313-330 - Sylvain Lombardy:
Two-way representations and weighted automata. 331-350 - Frantisek Mráz, Friedrich Otto, Daniel Prusa:
Some classes of rational functions for pictures. 351-369 - Özlem Salehi, A. C. Cem Say, Flavio D'Alessandro:
Homing vector automata. 371-386
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.