10 (2005) 1
-
M. ANSELMO, M. MADONIA:
A
Language-Theoretic Approach to Covering Problems.
Journal of Automata, Languages and Combinatorics 10 (2005) 1,
3–24.
-
M. H. ARMANIOUS:
Cubic and Semi-Cubic
SQS-Skeins. Journal of Automata, Languages and
Combinatorics 10 (2005) 1, 25–35.
-
J. CZYZOWICZ, W. FRACZAK, A. PELC:
Transducers with Set Output.
Journal of Automata, Languages and Combinatorics 10
(2005) 1, 37–49.
-
J.-P. DUVAL, T. LECROQ,
A. LEFEBVRE:
Border Array on Bounded Alphabet. Journal of
Automata, Languages and Combinatorics 10 (2005) 1, 51–60.
-
T. Y. NISHIDA:
Some New Aspects of Word-Length
Controlled DT0L Systems. Journal of Automata,
Languages and Combinatorics 10 (2005) 1, 61–77.
-
A. PANHOLZER:
Gröbner Bases and the Defining Polynomial of a Context-Free Grammar
Generating Function. Journal of Automata, Languages
and Combinatorics 10 (2005) 1, 79–97.
10 (2005) 2/3
Special Issue:
Selected Papers of the Workshop
Weighted Automata: Theory and Applications
(Dresden, Germany, June 1–5, 2004)
-
B. BORCHARDT, Z. FÜLÖP, Z. GAZDAG, A. MALETTI:
Bounds for Tree Automata with
Polynomial Costs. Journal of Automata, Languages and
Combinatorics 10 (2005) 2/3, 107–157.
-
S. BOZAPALIDIS, A. GRAMMATIKOPOULOU:
Recognizable Picture Series. Journal of Automata,
Languages and Combinatorics 10 (2005) 2/3, 159–183.
-
G. R. SYMEON BOZAPALIDIS:
On
the Closure of Recognizable Tree Series Under Tree Homomorphisms.
Journal of Automata, Languages and Combinatorics 10
(2005) 2/3, 185–202.
-
Z. ÉSIK, W. KUICH:
A
Semiring-Semimodule Generalization of ω-Regular Languages I.
Journal of Automata, Languages and Combinatorics 10
(2005) 2/3, 203–242.
-
Z. ÉSIK, W. KUICH:
A
Semiring-Semimodule Generalization of ω-Regular Languages II.
Journal of Automata, Languages and Combinatorics 10
(2005) 2/3, 243–264.
-
M. GIRAUD, D. LAVENIER:
Dealing
with Hardware Space Limits when Removing Epsilon-Transitions in a Genomic
Weighted Finite Automaton. Journal of Automata,
Languages and Combinatorics 10 (2005) 2/3, 265–285.
-
D. KIRSTEN, I. MÄURER:
On the
Determinization of Weighted Automata. Journal of
Automata, Languages and Combinatorics 10 (2005) 2/3,
287–312.
-
I. MEINECKE:
The
Hadamard Product of Sequential-Parallel Series.
Journal of Automata, Languages and Combinatorics 10 (2005) 2/3,
313–346.
-
G. TISCHLER:
Properties and Applications of Parametric Weighted Finite
Automata. Journal of Automata, Languages and
Combinatorics 10 (2005) 2/3, 347–365.
-
A. ZOLLMANN, K. SIMA'AN:
A
Consistent and Efficient Estimator for Data-Oriented Parsing.
Journal of Automata, Languages and Combinatorics 10 (2005)
2/3, 367–388.
10 (2005) 4
-
P. BOUYER, F. CHEVALIER:
On
Conciseness of Extensions of Timed Automata. Journal
of Automata, Languages and Combinatorics 10 (2005) 4,
393–405.
-
K. ELLUL, B. KRAWETZ, J. SHALLIT, M.-W. WANG:
Regular
Expressions: New Results and Open Problems. Journal
of Automata, Languages and Combinatorics 10 (2005) 4,
407–437.
-
O. FINKEL:
On the
Length of the Wadge Hierarchy of ω-Context Free Languages.
Journal of Automata, Languages and Combinatorics 10
(2005) 4, 439–464.
-
C. FROUGNY, L. VUILLON:
Coding of
Two-Dimensional Constraints of Finite Type by Substitutions.
Journal of Automata, Languages and Combinatorics 10 (2005)
4, 465–482.
-
Z. GAZDAG:
Shape
Preserving Bottom-Up Tree Transducers. Journal of
Automata, Languages and Combinatorics 10 (2005) 4, 483–534.
-
A. MALETTI, H. VOGLER:
Incomparability Results for Classes of Polynomial Tree Series
Transformations. Journal of Automata, Languages and
Combinatorics 10 (2005) 4, 535–568.
10 (2005) 5/6
Special Issue:
Selected Papers of the
Prague Stringology Conference
(Czech Technical University in Prague, Czech Republic, September 22–24, 2003)
-
B. BEHZADI, J.-M. STEYAERT:
The Transformation Distance
Problem Revisited. Journal of Automata, Languages and
Combinatorics 10 (2005) 5/6, 577–587.
-
D. CANTONE, S. FARO:
Fast-Search
Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching
Algorithm. Journal of Automata, Languages and
Combinatorics 10 (2005) 5/6, 589–608.
-
M. CHRISTODOULAKIS, C. S. ILIOPOULOS,
K. PARK, J. S. SIM:
Approximate Seeds of Strings. Journal of
Automata, Languages and Combinatorics 10 (2005) 5/6,
609–626.
-
L. CLEOPHAS, G. ZWAAN, B. W. WATSON:
Constructing Factor Oracles. Journal of Automata,
Languages and Combinatorics 10 (2005) 5/6, 627–640.
-
R. COLE, C. S. ILIOPOULOS,
M. MOHAMED, W. F. SMYTH, L. YANG:
The
Complexity of the Minimum k-Cover Problem. Journal
of Automata, Languages and Combinatorics 10 (2005) 5/6,
641–653.
-
A. FATHOLAHZADEH:
Learning the Morphological Features of a Large Set of Words.
Journal of Automata, Languages and Combinatorics 10
(2005) 5/6, 655–669.
-
R. GROULT, M. LÉONARD, L. MOUCHARD:
A Linear
Algorithm for the Detection of Evolutive Tandem Repeats.
Journal of Automata, Languages and Combinatorics 10 (2005) 5/6,
671–685.
-
C. ILIOPOULOS, L. MOUCHARD, K. PERDIKURI, A. TSAKALIDIS:
Computing the Repetitions in a Biological Weighted Sequence.
Journal of Automata, Languages and Combinatorics 10
(2005) 5/6, 687–696.
-
T. NAKATOH, K. BABA, D. IKEDA, Y. YAMADA,
S. HIROKAWA:
An
Efficient Mapping for Computing the Score of String Matching.
Journal of Automata, Languages and Combinatorics 10
(2005) 5/6, 697–704.
|