Learn More
We investigate the continuity of the ω-functions and real functions defined by weighted finite automata (WFA). We concentrate on the case of average preserving WFA. We show that every continuous ω-function definable by some WFA can be defined by an average preserving WFA and then characterize minimal average preserving WFA whose ω-function or ω-function and(More)
The main result of this paper is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all constraints are even ∆-matroid relations (represented by lists of tuples). As a consequence of this, we(More)
Möbius number systems represent points using sequences of Möbius transformations. Thorough the paper, we are mainly interested in representing the unit circle (which is equivalent to representing R ∪ {∞}). The main aim of the paper is to improve already known tools for proving that a given subshift–iterative system pair is in fact a Möbius number system. We(More)