C. ALLAUZEN, M. MOHRI:
Efficient
Algorithms for Testing the Twins Property.
Journal of
Automata, Languages and Combinatorics 8 (2003) 2, 117–144.
-
M. S. BALAN,
K. KRITHIVASAN, M. MADHU:
Some Variants
in Communication of Parallel Communicating Pushdown Automata.
Journal of Automata, Languages and Combinatorics 8 (2003)
3, 401–416.
-
S. N. BEREG,
A. V. KELAREV:
An Algorithm for Analysis of Images
in Spatial Information Systems.
Journal of Automata,
Languages and Combinatorics 8 (2003) 4, 557–565.
-
S. L. BLOOM,
Z. ÉSIK:
An
Extension Theorem with an Application to Formal Tree Series.
Journal of Automata, Languages and Combinatorics 8 (2003)
2, 145–185.
-
B. BORCHARDT, H. VOGLER:
Determinization of Finite State Weighted Tree Automata.
Journal of Automata, Languages and Combinatorics 8 (2003) 3,
417–463.
-
P. BUCHHOLZ, P. KEMPER:
Weak
Bisimulation for ( max /+) Automata and Related Models.
Journal of Automata, Languages and Combinatorics 8 (2003) 2,
187–218.
-
N. J. CAVENAGH:
Latin Trade Algorithms and the
Smallest Critical Set in a Latin Square.
Journal of
Automata, Languages and Combinatorics 8 (2003) 4, 567–578.
-
F. D'ALESSANDRO:
On the Complexity of Simon
Automata over the Dyck Language.
Journal of Automata,
Languages and Combinatorics 8 (2003) 3, 465–476.
-
M. DALEY, O. H. IBARRA, L. KARI, I. MCQUILLAN, K. NAKANO:
The ld and dlad Bio-Operations on
Formal Languages.
Journal of Automata, Languages and
Combinatorics 8 (2003) 3, 477–498.
-
F. DREWES, S. EWERT, R. KLEMPIEN-HINRICHS,
H.-J. KREOWSKI:
Computing Raster Images from Grid
Picture Grammars.
Journal of Automata, Languages and
Combinatorics 8 (2003) 3, 499–519.
-
F. DREWES, R. KLEMPIEN-HINRICHS, H.-J. KREOWSKI:
Table-Driven and Context-Sensitive Collage Languages.
Journal of Automata, Languages and Combinatorics 8 (2003) 1,
5–24.
-
D. ERMEL, D. WÄTJEN:
Limited
IL Systems.
Journal of Automata, Languages and
Combinatorics 8 (2003) 1, 25–42.
-
Z. ÉSIK, W. KUICH:
Formal Tree
Series.
Journal of Automata, Languages and
Combinatorics 8 (2003) 2, 219–285.
-
C.-M. FAN, H.-J. SHYR:
Languages
Related to the Properties of Disjunctivity and Code.
Journal of Automata, Languages and Combinatorics 8 (2003) 3,
521–538.
-
F. FRANEK, J. HOLUB, W. F. SMYTH, X. XIAO:
Computing Quasi Suffix Arrays.
Journal of Automata, Languages and Combinatorics 8
(2003) 4, 593–606.
-
F. FRANEK, W. F. SMYTH, Y. TANG:
Computing All
Repeats Using Suffix Arrays.
Journal of Automata,
Languages and Combinatorics 8 (2003) 4, 579–591.
-
B. IMREH, C. IMREH, M. ITO:
On Monotonic Directable
Nondeterministic Automata.
Journal of Automata,
Languages and Combinatorics 8 (2003) 3, 539–547.
-
B. KHOUSSAINOV, S. RUBIN:
Automatic
Structures: Overview and Future Directions.
Journal of
Automata, Languages and Combinatorics 8 (2003) 2, 287–301.
-
S. KITAEV:
There
are no Iterated Morphisms that Define the Arshon Sequence and the
σ-Sequence.
Journal of Automata, Languages and
Combinatorics 8 (2003) 1, 43–50.
-
G. LAGOGIANNIS, C. MAKRIS, Y. PANAGIS, S. SIOUTAS,
K. TSICHLAS:
New
Dynamic Balanced Search Trees with Worst-Case Constant Update Time.
Journal of Automata, Languages and Combinatorics 8
(2003) 4, 607–632.
-
G. LAGOGIANNIS, C. MAKRIS, Y. PANAGIS, S. SIOUTAS,
K. TSICHLAS:
Rectangle Enclosure Reporting in Linear Space Revisited.
Journal of Automata, Languages and Combinatorics 8 (2003) 4,
633–645.
-
A. LEFEBVRE, T. LECROQ, J. ALEXANDRE:
An Improved Algorithm for Finding
Longest Repeats with a Modified Factor Oracle.
Journal
of Automata, Languages and Combinatorics 8 (2003) 4,
647–657.
-
J. LIEBEHENSCHEL:
On the Connection Between Lexicographical Generation and Ranking.
Journal of Automata, Languages and Combinatorics 8
(2003) 1, 51–57.
-
C. C. LINDNER:
A Small Embedding for Partial
4-Cycle Systems when the Leave is Small.
Journal of
Automata, Languages and Combinatorics 8 (2003) 4, 659–662.
-
P. MANYEM, R. L. SALT, M. S. VISSER:
Approximation Lower Bounds in Online LIB Bin Packing and
Covering.
Journal of Automata, Languages and
Combinatorics 8 (2003) 4, 663–674.
-
C. MARTÍN-VIDE, V. MITRANA, R. STIEBE:
Weighted Grammars and Automata with
Threshold Interpretation.
Journal of Automata,
Languages and Combinatorics 8 (2003) 2, 303–318.
-
E. PETRE:
Watson-Crick ω-Automata.
Journal of
Automata, Languages and Combinatorics 8 (2003) 1, 59–70.
-
O. RAVSKY:
A New
Measure of Asymmetry of Binary Words.
Journal of
Automata, Languages and Combinatorics 8 (2003) 1, 71–74.
-
O. RAVSKY:
On the
Palindromic Decomposition of Binary Words.
Journal of
Automata, Languages and Combinatorics 8 (2003) 1, 75–83.
-
J. J. M. M. RUTTEN:
Coinductive
Counting with Weighted Automata.
Journal of Automata,
Languages and Combinatorics 8 (2003) 2, 319–352.
-
A. N. M. SALMAN, H. BROERSMA,
E. T. BASKORO:
Spanning 2-Connected Subgraphs in
Alphabet Graphs, Special Classes of Grid Graphs.
Journal of Automata, Languages and Combinatorics 8 (2003) 4,
675–681.
-
L. STAIGER:
Weighted Finite Automata and Metrics in Cantor Space.
Journal of Automata, Languages and Combinatorics 8 (2003) 2,
353–360.
-
E. W. STARK:
On Behaviour Equivalence for Probabilistic I/O Automata and
its Relationship to Probabilistic Bisimulation.
Journal of Automata, Languages and Combinatorics 8 (2003) 2,
361–395.
-
D. WÄTJEN:
Remarks on Simple Eco-Grammar Systems with Prescribed Teams.
Journal of Automata, Languages and Combinatorics 8 (2003)
1, 85–108.
|
