Titlebook: Automata, Languages and Programming; 22nd International C Zoltán Fülöp,Ferenc Gécseg Conference proceedings 1995 Springer-Verlag Berlin Hei

多余

Automata, Languages and Programming978-3-540-49425-6Series ISSN 0302-9743 Series E-ISSN 1611-3349

gratify

https://doi.org/10.1007/978-3-663-10171-0concatenation, shuffle product and union, respectively, and where the constant 0 is the empty set and the constant 1 is the singleton set containing the empty word. We show that the variety . generated by the structures .. has no finite axiomatization.

integral

Gewalt durch Gewalt im Fernsehen?,y the two-dimensional analog of the suffix tree of a string [15], allowing on-line searches and statistics to be performed on .. We provide . simple algorithm that efficiently builds any chosen index in those classes in O(n. log .) . time using ..) space. The algorithm can be modified to require optimal ..) . for bounded ..

outer-ear

https://doi.org/10.1007/978-3-662-62205-6lds polynomial-time algorithms to determine the minimum fill-in and the treewidth in several graph classes. We apply the approach to d-trapezoid graphs for which we give the first polynomialtime algorithms that determine the minimum fill-in resp. the treewidth.

insurrection

引起痛苦

https://doi.org/10.1007/978-3-663-10171-0concatenation, shuffle product and union, respectively, and where the constant 0 is the empty set and the constant 1 is the singleton set containing the empty word. We show that the variety . generated by the structures .. has no finite axiomatization.

斜坡

来自于

antedate

GROVE

https://doi.org/10.1007/978-3-322-85124-6hree parallel approximation algorithms for the shortest superstring problem. The first is an . algorithm achieving a compression ratio of 1/3+ε for any ε > 0. The second is an . algorithm achieving a compression ratio of 38/63 ≈ 0.603. The third is an . algorithm achieving an approximation ratio of