default search action
RAIRO - Theoretical Informatics and Applications, Volume 48
Volume 48, Number 1, January 2014
- Markus Holzer
, Bianca Truthe
Preface. 1-2
- Marcel Vollweiler, Friedrich Otto:
Systems of parallel communicating restarting automata. 3-22 - Fumiya Okubo:
Reaction automata working in sequential manner. 23-38 - Martin Kutrib
Bidirectional string assembling systems. 39-59 - Friedrich Otto, Peter Cerno, Frantisek Mráz
On the classes of languages accepted by limited context restarting automata. 61-84 - Norbert Hundeshagen, Peter Leupold:
Transducing by observing length-reducing and painter rules. 85-105 - Ivone Amorim
On the invertibility of finite linear transducers. 107-125 - Jürgen Dassow, Stefan Rudolf:
Conditional Lindenmayer systems with subregular conditions: The non-extended case. 127-147
Volume 48, Number 2, April 2014
- Michel Latteux, Yves Roos
One-Rule Length-Preserving Rewrite Systems and Rational Transductions. 149-171 - Marco Almeida, Nelma Moreira
Incremental DFA minimisation. 173-186 - Shenggen Zheng
On the state complexity of semi-quantum finite automata. 187-207 - Thomas Brodag, Steffen Herbold
A Generalized Model of PAC Learning and its Applicability. 209-245
Volume 48, Number 3, July 2014
- Raphaël M. Jungers, Véronique Bruyère, Romain Hollanders, Michel Rigo
Special issue in the honor of the 14th "Journées Montoises d'Informatique Théorique" - Foreword. 247
- Valérie Berthé, Timo Jolivet, Anne Siegel:
Connectedness of fractals associated with Arnoux-Rauzy substitutions. 249-266 - Gerhard Lischke:
Root clustering of words. 267-280 - Pascal Caron, Jean-Marc Champarnaud, Ludovic Mignot
A general framework for the derivation of regular expressions. 281-305 - Mari Huova:
Existence of an infinite ternary 64-abelian square-free word. 307-314 - Francine Blanchet-Sadri, Benjamin De Winkle, Sean Simmons:
Abelian pattern avoidance in partial words. 315-339 - Zuzana Masáková, Tomás Vávra
Integers in number systems with positive and negative quadratic Pisot base. 341-367
Volume 48, Number 4, October 2014
- Robert Mercas
Binary patterns in binary cube-free words: Avoidability and growth. 369-389 - Philippe Narbel:
Bouquets of circles for lamination languages and complexities. 391-418 - Golnaz Badkobeh, Maxime Crochemore
Finite repetition threshold for large alphabets. 419-430 - Nathalie Aubrun, Marie-Pierre Béal:
Tree algebra of sofic tree languages. 431-451 - Anna E. Frid, Damien Jamet:
The number of binary rotation words. 453-465 - Robert Mercas
5-Abelian cubes are avoidable on binary alphabets. 467-478
Volume 48, Number 5, December 2014
- Hans-Joachim Böckenhauer
Improved approximations for ordered TSP on near-metric graphs. 479-494 - Parsa Bakhtary, Othman Echi
On minimal Hamming compatible distances. 495-503 - Daniel Prusa
Two-dimensional Sgraffito automata. 505-539 - Min Chih Lin, Michel J. Mizrahi:
Domination problems on P5-free graphs. 541-549
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.
last updated on 2024-12-19 22:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: