Volume 7,
Number 1,
2002
- Sergey V. Avgustinovich, Anna E. Frid:
Words Avoiding Abelian Inclusions.
3-9
- Joost Engelfriet, Zoltán Fülöp, Heiko Vogler:
Bottom-Up and Top-Down Tree Series Transformations.
11-70
- Ferenc Gécseg, Balázs Imreh:
On Monotone Automata and Monotone Languages.
71-82
- Lucien Haddad, Hajime Machida, Ivo G. Rosenberg:
Maximal and Minimal Partial Clones.
83-93
- Carlo Mereghetti, Beatrice Palano:
The Parallel Complexity of Deterministic and Probabilistic Automata.
95-108
- Albert R. Meyer, Alexander Moshe Rabinovich:
Valid Identity Problem for Shuffle Regular Expressions.
109-125
- Eileen Peluso, Jonathan Goldstine, Shashi Phoha:
Normal Processes for Modeling the Desired Behavior of Distributed Autonomous Discrete Event Systems.
127-142
- Huei-Jan Shyr:
Regular Nests.
143-157
Volume 7,
Number 2,
2002
Volume 7,
Number 3,
2002
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
- K. Arthi, Kamala Krithivasan, Erzsébet Csuhaj-Varjú:
On Rule-Number Complexity of Components of Probabilistic Cooperating Distributed Grammar Systems.
433-446
- Henning Bordihn, Bernd Reichel:
On Descriptions of Context-Free Languages by CD Grammar Systems.
447-454
- Michael Domaratzki:
State Complexity of Proportional Removals.
455-468
- Michael Domaratzki, Derek Kisman, Jeffrey Shallit:
On the Number of Distinct Languages Accepted by Finite Automata with n States.
469-486
- Henning Fernau, Markus Holzer:
Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components.
487-503
- Kosaburo Hashiguchi, Takahiro Kunai, Shuji Jimbo:
Finite Codes over Free Binoids.
505-518
- Juraj Hromkovic:
Descriptional Complexity of Finite Automata: Concepts and Open Problems.
519-531
- Martin Kutrib:
Refining Nondeterminism Below Linear Time.
533-547
- Andreas Malcher:
Descriptional Complexity of Cellular Automata and Decidability Questions.
549-560
- Carlos Martín-Vide, Victor Mitrana:
Grammars with Bounded-Life Resources.
561-570
- Alexander Meduna:
Descriptional Complexity of Scattered Rewriting and Multirewriting: An Overview.
571-577
- Patrice Séébold:
About some Overlap-Free Morphisms on a n-Letter Alphabet.
579-597
- Ferucio Laurentiu Tiplea, Erkki Mäkinen:
On the Complexity of a Problem on Monadic String Rewriting Systems.
599-609
Copyright © Mon Nov 2 21:43:04 2009
by Michael Ley (ley@uni-trier.de)
