7 (2002) 1
S. V. AVGUSTINOVICH, A. E.
FRID:
Words Avoiding Abelian
Inclusions.
Journal of Automata, Languages and
Combinatorics 7 (2002) 1, 3–9.
-
J. ENGELFRIET, Z. FÜLÖP, H. VOGLER:
Bottom-Up
and Top-Down Tree Series Transformations.
Journal of
Automata, Languages and Combinatorics 7 (2002) 1, 11–70.
-
F. GÉCSEG, B. IMREH:
On Monotone
Automata and Monotone Languages.
Journal of Automata,
Languages and Combinatorics 7 (2002) 1, 71–82.
-
L. HADDAD, H. MACHIDA, I. G. ROSENBERG:
Maximal
and Minimal Partial Clones.
Journal of Automata,
Languages and Combinatorics 7 (2002) 1, 83–93.
-
C. MEREGHETTI, B. PALANO:
The Parallel
Complexity of Deterministic and Probabilistic Automata.
Journal of Automata, Languages and Combinatorics 7 (2002) 1,
95–108.
-
A. R. MEYER,
A. RABINOVICH:
Valid Identity Problem for Shuffle Regular Expressions.
Journal of Automata, Languages and Combinatorics 7 (2002) 1,
109–125.
-
E. PELUSO, J. GOLDSTINE, S. PHOHA:
Normal
Processes for Modeling the Desired Behavior of Distributed Autonomous
Discrete Event Systems.
Journal of Automata, Languages
and Combinatorics 7 (2002) 1, 127–142.
-
H.-J. SHYR:
Regular Nests.
Journal of Automata, Languages and Combinatorics 7 (2002) 1,
143–157.
7 (2002) 2
Special Issue:
Selected Papers of the Workshop on
Logic and Algebra for Concurrency
(Dresden, Germany, September 13–16, 2000)
-
P. BOUYER, A. PETIT:
A
Kleene/Büchi-like Theorem for Clock Languages.
Journal of Automata, Languages and Combinatorics 7 (2002) 2,
167–186.
-
D. KUSKE, R. MORIN:
Pomsets for
Local Trace Languages.
Journal of Automata, Languages
and Combinatorics 7 (2002) 2, 187–224.
-
D. PELED, M. Y. VARDI, M. YANNAKAKIS:
Black
Box Checking.
Journal of Automata, Languages and
Combinatorics 7 (2002) 2, 225–246.
-
P. TESSON, D. THÉRIEN:
The
Computing Power of Programs over Finite Monoids.
Journal of Automata, Languages and Combinatorics 7 (2002) 2,
247–258.
-
I. WALUKIEWICZ:
Local Logics for Traces.
Journal of Automata,
Languages and Combinatorics 7 (2002) 2, 259–290.
7 (2002) 3
-
T. A. AL-HAWARY:
Characterizations of Certain Matroids via Flats.
Journal of Automata, Languages and Combinatorics 7 (2002) 3,
295–301.
-
C. CÂMPEANU, K. SALOMAA, S. YU:
Tight Lower Bound for the State
Complexity of Shuffle of Regular Languages.
Journal of
Automata, Languages and Combinatorics 7 (2002) 3, 303–310.
-
C. GERMAIN, J. PALLO:
Linear
Languages with a Nonassociative Concatenation.
Journal
of Automata, Languages and Combinatorics 7 (2002) 3,
311–320.
-
M. MOHRI:
Semiring
Frameworks and Algorithms for Shortest-Distance Problems.
Journal of Automata, Languages and Combinatorics 7 (2002) 3,
321–350.
-
M. RIGO, A. MAES:
More on
Generalized Automatic Sequences.
Journal of Automata,
Languages and Combinatorics 7 (2002) 3, 351–376.
-
D.-C. VOINESCU:
On the Combinatorial Alphabets of
a Language.
Journal of Automata, Languages and
Combinatorics 7 (2002) 3, 377–394.
-
L. ZHANG, K. INOUE, A. ITO, Y. WANG:
A Leaf-Size Hierarchy of Alternating Rebound Turing
Machines.
Journal of Automata, Languages and
Combinatorics 7 (2002) 3, 395–410.
7 (2002) 4
Special Issue:
Selected Papers of the Third International Workshop on
Descriptional Complexity of Automata, Grammars and Related Structures
(Vienna, Austria, July 20–22, 2001)
-
H. N. ADORNA:
3-Party Message Complexity is Better
than 2-Party Ones for Proving Lower Bounds on the Size of Minimal
Nondeterministic Finite Automata.
Journal of Automata,
Languages and Combinatorics 7 (2002) 4, 419–432.
-
K. ARTHI, K. KRITHIVASAN, E. CSUHAJ-VARJÚ:
On Rule-Number Complexity of
Components of Probabilistic Cooperating Distributed Grammar Systems.
Journal of Automata, Languages and Combinatorics 7
(2002) 4, 433–446.
-
H. BORDIHN, B. REICHEL:
On
Descriptions of Context-Free Languages by CD Grammar Systems.
Journal of Automata, Languages and Combinatorics 7 (2002)
4, 447–454.
-
M. DOMARATZKI:
State Complexity of Proportional Removals.
Journal
of Automata, Languages and Combinatorics 7 (2002) 4,
455–468.
-
M. DOMARATZKI, D. KISMAN, J. SHALLIT:
On the Number of Distinct Languages
Accepted by Finite Automata with n States.
Journal
of Automata, Languages and Combinatorics 7 (2002) 4,
469–486.
-
H. FERNAU, M. HOLZER:
Graph-Controlled Cooperating Distributed Grammar Systems with Singleton
Components.
Journal of Automata, Languages and
Combinatorics 7 (2002) 4, 487–503.
-
K. HASHIGUCHI, T. KUNAI, S. JIMBO:
Finite Codes over Free
Binoids.
Journal of Automata, Languages and
Combinatorics 7 (2002) 4, 505–518.
-
J. HROMKOVIC:
Descriptional Complexity of Finite Automata: Concepts and Open
Problems.
Journal of Automata, Languages and
Combinatorics 7 (2002) 4, 519–531.
-
M. KUTRIB:
Refining Nondeterminism Below Linear Time.
Journal
of Automata, Languages and Combinatorics 7 (2002) 4,
533–547.
-
A. MALCHER:
Descriptional Complexity of Cellular Automata and Decidability
Questions.
Journal of Automata, Languages and
Combinatorics 7 (2002) 4, 549–560.
-
C. MARTÍN-VIDE, V. MITRANA:
Grammars with Bounded-Life
Resources.
Journal of Automata, Languages and
Combinatorics 7 (2002) 4, 561–570.
-
A. MEDUNA:
Descriptional Complexity of Scattered Rewriting and Multirewriting: An
Overview.
Journal of Automata, Languages and
Combinatorics 7 (2002) 4, 571–577.
-
P. SÉÉBOLD:
About some Overlap-Free Morphisms on a n-Letter Alphabet.
Journal of Automata, Languages and Combinatorics 7 (2002)
4, 579–597.
-
F. L. TIPLEA, E. MÄKINEN:
On the Complexity of a Problem
on Monadic String Rewriting Systems.
Journal of
Automata, Languages and Combinatorics 7 (2002) 4, 599–609.
|
