The second-order monadic theory of the free inverse monoid is undecidable. (La théorie monadique du second ordre du monoïde inversif libre est indécidable.)
The semigroup of a strongly connected automaton.
The separability of formal languages
The server specification for information retrieval of bibliographic data.
The shape of a category up to directed homotopy.
The similarity of two strings of fuzzy sets
Let be the strings of fuzzy sets over , where is a finite universe of discourse. We present the algorithms for operations on fuzzy sets and the polynomial time algorithms to find the string over which is a closest common subsequence of fuzzy sets of and using different operations to measure a similarity of fuzzy sets.
The single (and multi) item profit maximizing capacitated lot–size (PCLSP) problem with fixed prices and no set–up
This paper proposes a specialized LP-algorithm for a sub problem arising in simple Profit maximising Lot-sizing. The setting involves a single (and multi) item production system with negligible set-up costs/times and limited production capacity. The producer faces a monopolistic market with given time-varying linear demand curves.
The size of triangulations supporting a given link.
The stack-size of combinatorial tries revisited.
The star clustering algorithm for static and dynamic information organization.
The statistical interpretation and modification of GUHA method
The strong independence of substitution and homomorphic replication
The structural description of self-embedding nature of waveform peaks
The Structure and complexity of interactive zero-knowledge proofs
The structure of index sets and reduced indexed grammars
The structure-from-motion reconstruction pipeline – a survey with focus on short image sequences
The problem addressed in this paper is the reconstruction of an object in the form of a realistically textured 3D model from images taken with an uncalibrated camera. We especially focus on reconstructions from short image sequences. By means of a description of an easy to use system, which is able to accomplish this in a fast and reliable way, we give a survey of all steps of the reconstruction pipeline. For the purpose of developing a coherent reconstruction system it is necessary to integrate...
The subword complexity of a two-parameter family of sequences.
The summation package Sigma: underlying principles and a rhombus tiling application.
The sum-product algorithm: algebraic independence and computational aspects
The sum-product algorithm is a well-known procedure for marginalizing an “acyclic” product function whose range is the ground set of a commutative semiring. The algorithm is general enough to include as special cases several classical algorithms developed in information theory and probability theory. We present four results. First, using the sum-product algorithm we show that the variable sets involved in an acyclic factorization satisfy a relation that is a natural generalization of probability-theoretic...
The tensor product of polynomials.