Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
MFCS
2005
Springer
12 years 1 months ago
An Invitation to Play
Wieslaw Zielonka
MFCS
2005
Springer
12 years 1 months ago
Explicit Inapproximability Bounds for the Shortest Superstring Problem
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...
Virginia Vassilevska
MFCS
2005
Springer
12 years 1 months ago
On Small Hard Leaf Languages
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 ...
Falk Unger
MFCS
2005
Springer
12 years 1 months ago
The Generalization of Dirac's Theorem for Hypergraphs
Endre Szemerédi, Andrzej Rucinski, Vojtech ...
MFCS
2005
Springer
12 years 1 months ago
D-Width: A More Natural Measure for Directed Tree Width
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...
Mohammad Ali Safari
MFCS
2005
Springer
12 years 1 months ago
On Beta-Shifts Having Arithmetical Languages
Let β be a real number with 1 < β < 2. We prove that the language of the β-shift is ∆0 n iff β is a ∆n-real. The special case where n is 1 is the independently inter...
Jakob Grue Simonsen
MFCS
2005
Springer
12 years 1 months ago
Strict Language Inequalities and Their Decision Problems
Systems of language equations of the form {ϕ(X1, . . . , Xn) = ∅, ψ(X1, . . . , Xn) = ∅} are studied, where ϕ, ψ may contain set-theoretic operations and concatenation; the...
Alexander Okhotin
MFCS
2005
Springer
12 years 1 months ago
Concurrent Automata vs. Asynchronous Systems
We compare the expressive power of two automata-based finite-state models of concurrency. We show that Droste’s and Kuske’s coherent stably concurrent automata and Bednarczyk...
Rémi Morin
MFCS
2005
Springer
12 years 1 months ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
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...
Markus Lohrey, Nicole Ondrusch
MFCS
2005
Springer
12 years 1 months ago
Dimension Is Compression
Abstract. Effective fractal dimension was defined by Lutz (2003) in order to quantitatively analyze the structure of complexity classes. Interesting connections of effective dim...
María López-Valdés, Elvira Ma...
books