Journal of Automata, Languages and Combinatorics, Volume 7

Volume 7, Number 1, 2002

• Sergey V. Avgustinovich, Anna E. Frid: Words Avoiding Abelian Inclusions. 3-9 BibTeX
• Joost Engelfriet, Zoltán Fülöp, Heiko Vogler: Bottom-Up and Top-Down Tree Series Transformations. 11-70 BibTeX
• Ferenc Gécseg, Balázs Imreh: On Monotone Automata and Monotone Languages. 71-82 BibTeX
• Lucien Haddad, Hajime Machida, Ivo G. Rosenberg: Maximal and Minimal Partial Clones. 83-93 BibTeX
• Carlo Mereghetti, Beatrice Palano: The Parallel Complexity of Deterministic and Probabilistic Automata. 95-108 BibTeX
• Albert R. Meyer, Alexander Moshe Rabinovich: Valid Identity Problem for Shuffle Regular Expressions. 109-125 BibTeX
• Eileen Peluso, Jonathan Goldstine, Shashi Phoha: Normal Processes for Modeling the Desired Behavior of Distributed Autonomous Discrete Event Systems. 127-142 BibTeX
• Huei-Jan Shyr: Regular Nests. 143-157 BibTeX

Volume 7, Number 2, 2002

• Patricia Bouyer, Antoine Petit: A Kleene/Büchi-like Theorem for Clock Languages. 167-186 BibTeX
• Dietrich Kuske, Rémi Morin: Pomsets for Local Trace Languages. 187-224 BibTeX
• Doron Peled, Moshe Y. Vardi, Mihalis Yannakakis: Black Box Checking. 225-246 BibTeX
• Pascal Tesson, Denis Thérien: The Computing Power of Programs over Finite Monoids. 247-258 BibTeX
• Igor Walukiewicz: Local Logics for Traces. 259-290 BibTeX

Volume 7, Number 3, 2002

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

Volume 7, Number 4, 2002

• Henry N. Adorna: 3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata. 419-432 BibTeX
• K. Arthi, Kamala Krithivasan, Erzsébet Csuhaj-Varjú: On Rule-Number Complexity of Components of Probabilistic Cooperating Distributed Grammar Systems. 433-446 BibTeX
• Henning Bordihn, Bernd Reichel: On Descriptions of Context-Free Languages by CD Grammar Systems. 447-454 BibTeX
• Michael Domaratzki: State Complexity of Proportional Removals. 455-468 BibTeX
• Michael Domaratzki, Derek Kisman, Jeffrey Shallit: On the Number of Distinct Languages Accepted by Finite Automata with n States. 469-486 BibTeX
• Henning Fernau, Markus Holzer: Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components. 487-503 BibTeX
• Kosaburo Hashiguchi, Takahiro Kunai, Shuji Jimbo: Finite Codes over Free Binoids. 505-518 BibTeX
• Juraj Hromkovic: Descriptional Complexity of Finite Automata: Concepts and Open Problems. 519-531 BibTeX
• Martin Kutrib: Refining Nondeterminism Below Linear Time. 533-547 BibTeX
• Andreas Malcher: Descriptional Complexity of Cellular Automata and Decidability Questions. 549-560 BibTeX
• Carlos Martín-Vide, Victor Mitrana: Grammars with Bounded-Life Resources. 561-570 BibTeX
• Alexander Meduna: Descriptional Complexity of Scattered Rewriting and Multirewriting: An Overview. 571-577 BibTeX
• Patrice Séébold: About some Overlap-Free Morphisms on a n-Letter Alphabet. 579-597 BibTeX
• Ferucio Laurentiu Tiplea, Erkki Mäkinen: On the Complexity of a Problem on Monadic String Rewriting Systems. 599-609 BibTeX