
ISBN: 3540659846
TITLE: Jewels are Forever
AUTHOR: Karhumki, Juhani; Maurer, Hermann; Paun, Gheorghe; Rozenberg, Grzegorz (Eds.)
TOC:

Laudation for Arto Salomaa XI
Bibliography of Arto Salomaa XIII
Part I. Automata I: Finite State Machines
Semilattices of Fault Semiautomata 3
Janusz A. Brzozowski, Helmut Jrgensen
Thompson Languages 16
Dora Giammarresi, Jean-Luc Ponty, Derick Wood
On Some Special Classes of Regular Languages 25
Balzs Imreh, Masami Ito
Synchronized Shuffle and Regular Languages 35
Michel Latteux, Yves Roos
Synchronization Expressions: Characterization Results and Implementation 45
Kai Salomaa, Sheng Yu
Part II. Automata II: More General Devices
Uniformization of Rational Relations 59
Christian Choffrut, Serge Grigorieff
Tree-Walking Pebble Automata 72
Joost Engelfriet, Hendrik Jan Hoogeboom
Counter Machines: Decision Problems and Applications 84
Oscar H. Ibarra, Jianwen Su
On the Equivalence of Finite Substitutions and Transducers 97
Juhani Karhumki, Leonid P. Lisovik
Complementation of Bchi Automata Revisited 109
Wolfgang Thomas
Part III. Automata with Multiplicities
Languages Accepted by Integer Weighted Finite Automata 123
Vesa Halava, Tero Harju
A Power Series Approach to Bounded Languages 135
Juha Honkala
Full Abstract Families of Tree Series I 145
Werner Kuich
Linear Automata, Rational Series and a Theorem of Fine and Wilf 157
Giovanna Melideo, Cesidia Pasquarelli, Stefano Varricchio
Part IV. Formal Languages
Numerical Parameters of Evolutionary Grammars 171
Jrgen Dassow
Iterated GSM Mappings: A Collapsing Hierarchy 182
Vincenzo Manca, Carlos Martn-Vide, Gheorghe Paun
On the Length of Words 194
Solomon Marcus
An Insertion into the Chomsky Hierarchy? 204
Robert McNaughton
Word Length Controlled DT0L Systems and Slender Languages 213
Taishin Yasunobu Nishida
Part V. Algorithms and Complexity
Program-Size Complexity of Initial Segments and Domination Reducibility 225
Cristian S. Calude, Richard J. Coles
Stability of Approximation Algorithms and the Knapsack Problem 238
Juraj Hromkovic
Some Examples of Average-case Analysis by the Incompressibility Method 250
Tao Jiang, Ming Li, Paul Vitnyi
Complexity of Language Recognition Problems for Compressed Words 262
Wojciech Plandowski, Wojciech Rytter
Algorithms on Continued Fractions 273
Octavian Soldea, Azaria Paz
Part VI. Combinatorics of Words
On the Index of Sturmian Words 287
Jean Berstel
Repetitions and Boxes in Words and Pictures 295
Arturo Carpi, Aldo de Luca
Small Aperiodic Sets of Triangular and Hexagonal Tiles 307
Karel Culik II
Quadratic Word Equations 314
Volker Diekert, John Michael Robson
Fair and Associative Infinite Trajectories 327
Alexandru Mateescu, George Daniel Mateescu
Forbidden Factors in Finite and Infinite Words 339
Filippo Mignosi, Antonio Restivo, Marinella Sciortino
Part VII. Novel Directions
Reversible Molecular Computation in Ciliates 353
Lila Kari, Jarkko Kari, Laura F. Landweber
Logic, Probability, and Rough Sets 364
Zdzislaw Pawlak
List of Contributors 375
END
