Home

Alexandr Kazda

  1. CSP for binary conservative relational structures.

    Wed, 12/07/2011 - 15:01 — SomNambul
    Authors: Alexandr Kazda
    Subjects: Combinatorics
    Abstract

    We prove that whenever A is a 3-conservative relational structure with only
    binary and unary relations then the algebra of polymorphisms of A either has no
    Taylor operation (i.e. CSP(A) is NP-complete), or generates a congruence meet
    semidistributive variety (i.e. CSP(A) has bounded width).

  2. The chain relation in sofic subshifts.

    Tue, 12/01/2009 - 16:01 — SomNambul
    Authors: Alexandr Kazda
    Subjects: Dynamical Systems
    Abstract

    The paper gives a characterisation of the chain relation of a sofic subshift.
    Every sofic subshift $\Sigma$ can be described by a labelled graph $G$.
    Factorising $G$ in a suitable way we obtain the graph $G/_\approx$ that offers
    insight into some properties of the original subshift. Using $G/_\approx$ we
    describe first the chain relation in $\Sigma$, then characterise
    chain-transitive sofic subshifts, chain-mixing sofic subshifts and finally the
    attractors of the subshift dynamic system.

  3. On Continuous Weighted Finite Automata.

    Thu, 08/27/2009 - 13:23 — SomNambul
    Authors: Alexandr Kazda, Jarkko Kari, Paula Steinby
    Subjects: Formal Languages and Automata Theory
    Abstract

    We investigate the continuity of the \omega-functions and real functions
    defined by weighted finite automata (WFA). We concentrate on the case of
    average preserving WFA. We show that every continuous \omega-function definable
    by some WFA can be defined by an average preserving WFA and then characterize
    minimal average preserving WFA whose \omega-function or \omega-function and
    real function are continuous.

  4. Properties of Moebius number systems.

    Thu, 08/27/2009 - 13:23 — SomNambul
    Authors: Alexandr Kazda
    Subjects: Dynamical Systems
    Abstract

    Moebius number systems represent points using sequences of Moebius
    transformations. Thorough the paper, we are mainly interested in representing
    the unit circle (which is equivalent to representing R\cup\{\infty\}).

  5. Properties of Moebius number systems.

    Thu, 08/27/2009 - 13:23 — SomNambul
    Authors: Alexandr Kazda
    Subjects: Dynamical Systems
    Abstract

    Moebius number systems represent points using sequences of Moebius
    transformations. Thorough the paper, we are mainly interested in representing
    the unit circle (which is equivalent to representing R\cup\{\infty\}).

Math-arch

Syndicate content