M. K. AHMAD,
X. AUGROS:
Some
Results on Codes for Generalized Factorizations.
Journal of Automata, Languages and Combinatorics 6 (2001) 3,
239–251.
-
S. AYDIN, H. JÜRGENSEN, L. E. ROBBINS:
Dialogues as Co-Operating Grammars.
Journal of Automata, Languages and Combinatorics 6 (2001) 4,
395–410.
-
V. BERTHÉ, L. VUILLON:
Palindromes
and Two-Dimensional Sturmian Sequences.
Journal of
Automata, Languages and Combinatorics 6 (2001) 2, 121–138.
-
H. BORDIHN, M. HOLZER:
On the
Number of Active Symbols in L and CD Grammar Systems.
Journal of Automata, Languages and Combinatorics 6 (2001) 4,
411–426.
-
D. BRIDGES, A. MAHALANOBIS:
Increasing, Nondecreasing, and Virtually Continuous Functions.
Journal of Automata, Languages and Combinatorics 6
(2001) 2, 139–143.
-
K. DENECKE, J. KOPPITZ, S. SHTRAKOV:
The Depth of a
Hypersubstitution.
Journal of Automata, Languages and
Combinatorics 6 (2001) 3, 253–262.
-
C. DIMA:
Real-Time
Automata.
Journal of Automata, Languages and
Combinatorics 6 (2001) 1, 3–23.
-
P. DÖMÖSI, Z. ÉSIK:
Homomorphic Simulation and Letichevsky's Criterion.
Journal of Automata, Languages and Combinatorics 6 (2001) 4,
427–436.
-
Z. FÜLÖP:
Characterizing Important Subclasses of Attributed Tree Transformations by
Macro Tree Transducers.
Journal of Automata, Languages
and Combinatorics 6 (2001) 2, 145–189.
-
C. GLASSER, H. SCHMITZ:
The Boolean
Structure of Dot-Depth One.
Journal of Automata,
Languages and Combinatorics 6 (2001) 4, 437–452.
-
Y. GUESNET:
On
Maximal Dense Bifix Codes.
Journal of Automata,
Languages and Combinatorics 6 (2001) 3, 263–273.
-
P.-C. HÉAM:
Some Topological Properties of
Rational Sets.
Journal of Automata, Languages and
Combinatorics 6 (2001) 3, 275–290.
-
J. HOLUB, C. S. ILIOPOULOS,
B. MELICHAR, L. MOUCHARD:
Distributed Pattern Matching Using Finite Automata.
Journal of Automata, Languages and Combinatorics 6 (2001) 2,
191–204.
-
M. HOLZER, K. SALOMAA, S. YU:
On the State Complexity of k-Entry
Deterministic Finite Automata.
Journal of Automata,
Languages and Combinatorics 6 (2001) 4, 453–466.
-
C. S. ILIOPOULOS, R. J.
SIMPSON:
On-Line Validation and
Analysis of Partially Occluded Images.
Journal of
Automata, Languages and Combinatorics 6 (2001) 3, 291–303.
-
H. JÜRGENSEN, M. KATSURA, S. KONSTANTINIDIS:
Maximal Solid Codes.
Journal of Automata, Languages and Combinatorics 6
(2001) 1, 25–50.
-
A. KELAREV, O. SOKRATOVA:
Directed
Graphs and Syntactic Algebras of Tree Languages.
Journal of Automata, Languages and Combinatorics 6 (2001) 3,
305–311.
-
R. KEMP:
On the
Expected Number of Leftist Nodes in Simply Generated Trees.
Journal of Automata, Languages and Combinatorics 6 (2001) 3,
313–343.
-
B. KHOUSSAINOV, S. RUBIN:
Graphs with
Automatic Presentations over a Unary Alphabet.
Journal
of Automata, Languages and Combinatorics 6 (2001) 4,
467–480.
-
S. N. KRISHNA,
R. RAMA:
P
Systems with Replicated Rewriting.
Journal of
Automata, Languages and Combinatorics 6 (2001) 3, 345–350.
-
E. MÄKINEN:
On
the Inclusion Problem for Very Simple Deterministic Pushdown
Automata.
Journal of Automata, Languages and
Combinatorics 6 (2001) 3, 351–357.
-
V. MANCA, C. MARTÍN-VIDE, G. PĂUN:
On the Power of P Systems with
Replicated Rewriting.
Journal of Automata, Languages
and Combinatorics 6 (2001) 3, 359–374.
-
M. MILANI, G. PIGHIZZINI:
Tight
Bounds on the Simulation of Unary Probabilistic Automata by Deterministic
Automata.
Journal of Automata, Languages and
Combinatorics 6 (2001) 4, 481–492.
-
F. MRÁZ:
Lookahead Hierarchies of Restarting Automata.
Journal of Automata, Languages and Combinatorics 6 (2001) 4,
493–506.
-
M. E. NEBEL:
On the Power of Subroutines for Finite State Machines.
Journal of Automata, Languages and Combinatorics 6
(2001) 1, 51–74.
-
T. Y. NISHIDA:
Sizes of Context-Free Languages
Generated by Context-Free Grammars and Stable and Recurrent 0L
Systems.
Journal of Automata, Languages and
Combinatorics 6 (2001) 4, 507–518.
-
A. OKHOTIN:
Conjunctive Grammars.
Journal of Automata,
Languages and Combinatorics 6 (2001) 4, 519–535.
-
F. OTTO, N. RUSKUC:
Confluent Monadic String-Rewriting Systems and Automatic
Structures.
Journal of Automata, Languages and
Combinatorics 6 (2001) 3, 375–388.
-
T. PETKOVIC, M. STEINBY:
Piecewise
Directable Automata.
Journal of Automata, Languages
and Combinatorics 6 (2001) 2, 205–220.
-
G. PĂUN:
P
Systems with Active Membranes: Attacking NP-Complete Problems.
Journal of Automata, Languages and Combinatorics 6 (2001)
1, 75–90.
-
J. SHALLIT, M.-W. WANG:
Automatic Complexity of
Strings.
Journal of Automata, Languages and
Combinatorics 6 (2001) 4, 537–554.
-
K. G. SUBRAMANIAN, D. G.
THOMAS, P. H.
CHANDRA, M. HOEBERECHTS:
Basic Puzzle Grammars and
Generation of Polygons.
Journal of Automata, Languages
and Combinatorics 6 (2001) 4, 555–568.
-
P. TURAKAINEN:
Injectivity of the Quotient h backslash g of two Morphisms and
Ambiguity of Linear Grammars.
Journal of Automata,
Languages and Combinatorics 6 (2001) 1, 91–96.
-
Y. VELINOV:
On the
Regions of Influence in Complex Decomposition Forms of Finite
Functions.
Journal of Automata, Languages and
Combinatorics 6 (2001) 4, 569–579.
-
D. WÄTJEN, D. OSTROVSKY:
Function-Limited 0L Systems Revisited.
Journal of
Automata, Languages and Combinatorics 6 (2001) 1, 97–114.
-
S. YU:
State
Complexity of Regular Languages.
Journal of Automata,
Languages and Combinatorics 6 (2001) 2, 221–234.
|
