Content of Issue 2
DOI: 10.3217/jucs-008-02
|
Advances and Trends in Automata and Formal Languages A Collection of Papers in Honour of the 60th Birthday of Helmut Juergensen - J.UCS Special Issue |
C.S. Calude, K. Salomaa, S. Yu |
117 |
On the Computational Complexity of Synchronized Context-Free Languages |
H. Bordihn, M. Holzer |
119 |
Additive Distances and Quasi_Distances Between Words |
C.S. Calude, K. Salomaa, S. Yu |
141 |
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms |
D. Cristofor, D. Simovici |
153 |
Rationally Additive Semirings |
Z. Ésik, W. Kuich |
173 |
On Quasi-Products of Tree Automata |
F. Gécseg |
184 |
Descriptional Complexity of Machines with Limited Resources |
J. Goldstine, M. Kappes, C.M. Kintala, H. Leung, A. Malcher, D. Wotschke |
193 |
Simply Normal Numbers to Different Bases |
P. Hertling |
235 |
Word Operation Closure and Primitivity of Languages |
H. K. Hsiao, C. C. Huang, S. S. Yu |
243 |
Shuffle Decomposition of Regular Languages |
M. Ito |
257 |
Some Remarks on Codes Defined by Petri Nets |
M. Ito, J. Dassow, R. Stiebe |
260 |
Synchronization and Stability of Finite Automata |
J. Kari |
270 |
Error-Correction, and Finite-Delay Decodability |
S. Konstantinidis |
278 |
Bridging Two Hierarchies of Infinite Words |
S. Marcus |
292 |
Tiling the Hyperbolic Plane with a Single Pentagonal Tile |
M. Margenstern |
297 |
On the Power of P Systems with Symport Rules |
C. Martín-Vide, A. Paun, G. Paun |
317 |
Generation of Constants and Synchronization of Finite Automata |
A. Salomaa |
332 |
How Large is the Set of Disjunctive Sequences? |
L. Staiger |
348 |
A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata |
B. W. Watson |
363 |