VOLUME 7 | 2002 | NUMBER 3 |
Talal A. Al-Hawary: | |
Characterizations of Certain Matroids via Flats | 295–301 |
Cezar Câmpeanu, Kai Salomaa, Sheng Yu: | |
Tight Lower Bound for the State Complexity of Shuffle of Regular Languages | 303–310 |
Christian Germain, Jean Pallo: | |
Linear Languages with a Nonassociative Concatenation | 311–320 |
Mehryar Mohri: | |
Semiring Frameworks and Algorithms for Shortest-Distance Problems | 321–350 |
Michel Rigo, Arnaud Maes: | |
More on Generalized Automatic Sequences | 351–376 |
Daniel-Claudian Voinescu: | |
On the Combinatorial Alphabets of a Language | 377–394 |
Lan Zhang, Katsushi Inoue, Akira Ito, Yue Wang: | |
A Leaf-Size Hierarchy of Alternating Rebound Turing Machines | 395–410 |