default search action
Journal of Automata, Languages and Combinatorics, Volume 10
Volume 10, Number 1, 2005
- Marcella Anselmo, Maria Madonia:
A Language-Theoretic Approach to Covering Problems. 3-24 - Magdi H. Armanious:
Cubic and Semi-Cubic SQS-Skeins. 25-35 - Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc:
Transducers with Set Output. 37-49 - Jean-Pierre Duval, Thierry Lecroq
, Arnaud Lefebvre:
Border Array on Bounded Alphabet. 51-60 - Taishin Y. Nishida:
Some New Aspects of Word-Length Controlled DT0L Systems. 61-77 - Alois Panholzer:
Gröbner Bases and the Defining Polynomial of a Context-Free Grammar Generating Function. 79-97
Volume 10, Number 2/3, 2005
Dresden, Germany, June 1-5, 2004
- Manfred Droste, Heiko Vogler:
Editorial. 105 - Björn Borchardt, Zoltán Fülöp, Zsolt Gazdag, Andreas Maletti:
Bounds for Tree Automata with Polynomial Costs. 107-157 - Symeon Bozapalidis, Archontia Grammatikopoulou:
Recognizable Picture Series. 159-183 - Symeon Bozapalidis:
On the Closure of Recognizable Tree Series Under Tree Homomorphisms. 185-202 - Zoltán Ésik, Werner Kuich:
A Semiring-Semimodule Generalization of ω-Regular Languages I. 203-242 - Zoltán Ésik, Werner Kuich:
A Semiring-Semimodule Generalization of ω-Regular Languages II. 243-264 - Mathieu Giraud, Dominique Lavenier:
Dealing with Hardware Space Limits when Removing Epsilon-Transitions in a Genomic Weighted Finite Automaton. 265-285 - Daniel Kirsten, Ina Mäurer:
On the Determinization of Weighted Automata. 287-312 - Ingmar Meinecke:
The Hadamard Product of Sequential-Parallel Series. 313-346 - German Tischler:
Properties and Applications of Parametric Weighted Finite Automata. 347-365 - Andreas Zollmann, Khalil Sima'an:
A Consistent and Efficient Estimator for Data-Oriented Parsing. 367-388
Volume 10, Number 4, 2005
- Patricia Bouyer, Fabrice Chevalier:
On Conciseness of Extensions of Timed Automata. 393-405 - Keith Ellul, Bryan Krawetz, Jeffrey O. Shallit, Ming-wei Wang:
Regular Expressions: New Results and Open Problems. 407-437 - Olivier Finkel:
On the Length of the Wadge Hierarchy of ω-Context Free Languages. 439-464 - Christiane Frougny, Laurent Vuillon:
Coding of Two-Dimensional Constraints of Finite Type by Substitutions. 465-482 - Zsolt Gazdag:
Shape Preserving Bottom-Up Tree Transducers. 483-534 - Andreas Maletti, Heiko Vogler:
Incomparability Results for Classes of Polynomial Tree Series Transformations. 535-568
Volume 10, Number 5/6, 2005
Czech Technical University in Prague, Czech Republic, September 22-24, 2003
- Jan Holub:
Editorial. 575 - Behshad Behzadi, Jean-Marc Steyaert:
The Transformation Distance Problem Revisited. 577-587 - Domenico Cantone, Simone Faro:
Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm. 589-608 - Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim:
Approximate Seeds of Strings. 609-626 - Loek G. Cleophas, Gerard Zwaan, Bruce W. Watson:
Constructing Factor Oracles. 627-640 - Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang:
The Complexity of the Minimum k-Cover Problem. 641-653 - Abolfazl Fatholahzadeh:
Learning the Morphological Features of a Large Set of Words. 655-669 - Richard Groult, Martine Léonard, Laurent Mouchard:
A Linear Algorithm for the Detection of Evolutive Tandem Repeats. 671-685 - Costas S. Iliopoulos, Laurent Mouchard, Katerina Perdikuri, Athanasios K. Tsakalidis:
Computing the Repetitions in a Biological Weighted Sequence. 687-696 - Tetsuya Nakatoh, Kensuke Baba, Daisuke Ikeda, Yasuhiro Yamada, Sachio Hirokawa:
An Efficient Mapping for Computing the Score of String Matching. 697-704
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-19 22:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: