C. CHOFFRUT, M. GOLDWURM:
Timed
Automata with Periodic Clock Constraints.
Journal of
Automata, Languages and Combinatorics 5 (2000) 4, 371–403.
-
E. CSUHAJ-VARJÚ:
Parallel Communicating Grammar
Systems with Bounded Resources: Results, Techniques, Open Problems.
Journal of Automata, Languages and Combinatorics 5
(2000) 3, 175–190.
-
R. DEVILLERS, H. KLAUDEL, E. PELZ:
An Algebraic Box Calculus.
Journal of Automata, Languages and Combinatorics 5
(2000) 2, 81–107.
-
Z. ÉSIK, W. KUICH:
A Kleene
Theorem for Lindenmayerian Algebraic Power Series.
Journal of Automata, Languages and Combinatorics 5 (2000) 2,
109–122.
-
R. FREUND:
Array
Grammar Systems.
Journal of Automata, Languages and
Combinatorics 5 (2000) 1, 13–29.
-
J. GASO:
Unreliable Colonies – the Sequential Case.
Journal
of Automata, Languages and Combinatorics 5 (2000) 1, 31–44.
-
J. GRUSKA:
Descriptional Complexity Issues in Quantum Computing.
Journal of Automata, Languages and Combinatorics 5 (2000) 3,
191–218.
-
K. HASHIGUCHI, S. ICHIHARA, S. JIMBO:
Formal
Languages over Free Bionoids.
Journal of Automata,
Languages and Combinatorics 5 (2000) 3, 219–234.
-
J. HONKALA:
On
Formal Power Series Generated by Lindenmayer Systems.
Journal of Automata, Languages and Combinatorics 5 (2000) 2,
123–144.
-
M. KAPPES:
Descriptional Complexity of Deterministic Finite Automata with Multiple
Initial States.
Journal of Automata, Languages and
Combinatorics 5 (2000) 3, 269–278.
-
J. KELEMEN, A. KELEMENOVÁ:
Grammar Systems: Where are we? And Where do we go from Here? (As an
Editorial).
Journal of Automata, Languages and
Combinatorics 5 (2000) 1, 5–12.
-
H. LEUNG:
On a
Family of Nondeterministic Finite Automata.
Journal of
Automata, Languages and Combinatorics 5 (2000) 3, 235–244.
-
C. MARTÍN-VIDE, A. MATEESCU:
Special Families of Sewing
Languages.
Journal of Automata, Languages and
Combinatorics 5 (2000) 3, 279–286.
-
A. MATEESCU, K. SALOMAA, S. YU:
On Fairness of Many-Dimensional
Trajectories.
Journal of Automata, Languages and
Combinatorics 5 (2000) 2, 145–157.
-
C. MEREGHETTI, G. PIGHIZZINI:
Two-Way
Automata Simulations and Unary Languages.
Journal of
Automata, Languages and Combinatorics 5 (2000) 3, 287–300.
-
V. MITRANA:
On the
Degree of Communication in Parallel Communicating Finite Automata
Systems.
Journal of Automata, Languages and
Combinatorics 5 (2000) 3, 301–314.
-
F. OTTO:
On Dehn
Functions of Finitely Presented Bi-Automatic Monoids.
Journal of Automata, Languages and Combinatorics 5 (2000) 4,
405–419.
-
H. PETERSEN:
Prefix Rewriting and Descriptional Complexity.
Journal of Automata, Languages and Combinatorics 5 (2000) 3,
245–254.
-
A. PĂUN:
On
the Diameter of Various Classes of H Systems.
Journal
of Automata, Languages and Combinatorics 5 (2000) 3,
315–324.
-
I. ROSENBERG, D. SCHWEIGERT:
Locally
Maximal Clones II.
Journal of Automata, Languages and
Combinatorics 5 (2000) 4, 421–455.
-
H. SCHMITZ:
Restricted Temporal Logic and Deterministic Languages.
Journal of Automata, Languages and Combinatorics 5 (2000) 3,
325–341.
-
J. M. SEMPERE:
On a Class of Regular-like
Expressions for Linear Languages.
Journal of Automata,
Languages and Combinatorics 5 (2000) 3, 343–354.
-
J. SHALLIT:
Automaticity and Rationality.
Journal of Automata,
Languages and Combinatorics 5 (2000) 3, 255–268.
-
P. SOSÍK:
On
the Decidability Problems of Eco-Grammar Systems.
Journal of Automata, Languages and Combinatorics 5 (2000) 1,
45–58.
-
L. SUBRAMANIAN, M. TALUPUR, K. KRITHIVASAN, C. P.
RANGAN:
On the Generative Power of
Simple H Systems.
Journal of Automata, Languages and
Combinatorics 5 (2000) 4, 457–473.
-
G. VASZIL:
Further
Remarks on Parallel Communicating Grammar Systems without a Master.
Journal of Automata, Languages and Combinatorics 5
(2000) 1, 59–75.
-
Y. VELINOV:
Regions of Influence in Simple Decomposition Forms of Finite
Functions.
Journal of Automata, Languages and
Combinatorics 5 (2000) 3, 355–366.
-
D. WÄTJEN:
Undecidability Results for Uniformly k-Limited 0L Systems.
Journal of Automata, Languages and Combinatorics 5 (2000)
2, 159–167.
|
