MFCS
2005
Springer
14 years 8 days ago
2005
Springer
MFCS
2005
Springer
14 years 8 days ago
2005
Springer
Abstract. Given a set of strings S = {s1, . . . , sn}, the Shortest Superstring problem asks for the shortest string s which contains each si as a substring. We consider two measur...
MFCS
2005
Springer
14 years 8 days ago
2005
Springer
This paper deals with balanced leaf language complexity classes, introduced independently in [1] and [14]. We propose the seed concept for leaf languages, which allows us to give ā...
MFCS
2005
Springer
14 years 8 days ago
2005
Springer
MFCS
2005
Springer
14 years 8 days ago
2005
Springer
Due to extensive research on tree-width for undirected graphs and due to its many applications in various ļ¬elds it has been a natural desire for many years to generalize the idea...
MFCS
2005
Springer
14 years 8 days ago
2005
Springer
Let Ī² be a real number with 1 < Ī² < 2. We prove that the language of the Ī²-shift is ā0 n iļ¬ Ī² is a ān-real. The special case where n is 1 is the independently inter...
MFCS
2005
Springer
14 years 8 days ago
2005
Springer
Systems of language equations of the form {Ļ(X1, . . . , Xn) = ā
, Ļ(X1, . . . , Xn) = ā
} are studied, where Ļ, Ļ may contain set-theoretic operations and concatenation; the...
MFCS
2005
Springer
14 years 8 days ago
2005
Springer
We compare the expressive power of two automata-based ļ¬nite-state models of concurrency. We show that Drosteās and Kuskeās coherent stably concurrent automata and Bednarczykā...
MFCS
2005
Springer
14 years 8 days ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Ī subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
MFCS
2005
Springer
14 years 8 days ago
2005
Springer
Abstract. Eļ¬ective fractal dimension was deļ¬ned by Lutz (2003) in order to quantitatively analyze the structure of complexity classes. Interesting connections of eļ¬ective dim...