FCT
2009
Springer
14 years 6 months ago
2009
Springer
We study the equivalence problem of deterministic nested word to word transducers and show it to be suprisingly robust. Modulo polynomal time reductions, it can be identified with...
FCT
2009
Springer
14 years 6 months ago
2009
Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
FCT
2009
Springer
14 years 6 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
FCT
2009
Springer
14 years 6 months ago
2009
Springer
Despite of their applicability betweennness constraints have (to the author’s knowledge) hardly been considered from the random structures point of view. They are essentially di...
FCT
2009
Springer
14 years 6 months ago
2009
Springer
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µ-calculus is strict. While graphs of entangl...
FCT
2009
Springer
14 years 6 months ago
2009
Springer
The n-ary first and second recursion theorems formalize two distinct, yet similar, notions of self-reference. Roughly, the n-ary first recursion theorem says that, for any n algo...
FCT
2009
Springer
14 years 6 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
FCT
2009
Springer
14 years 6 months ago
2009
Springer
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
FCT
2009
Springer
14 years 6 months ago
2009
Springer
FCT
2009
Springer
14 years 6 months ago
2009
Springer
