5 citations · 9 across the 8 of their papers we have counts for
8 papers
On the probability of n equidistant points in high-dimensional lattices
Stefan Gerdjikov, Martin Minchev, Mladen Savov
Consider -dimensional vectors with iid entries from a lattice distribution . We show that the probability that all distances between them are equal is asymptotically \[ C…
Some inequalities for norms in and
Stefan Gerdjikov, Nikolai Nikolov
The main result of this paper is that for any norm on a complex or real -dimensional linear space, every extremal basis satisfies inverted triangle inequality with scaling facto…
Note on the Lower Bounds of Bimachines
Stefan Gerdjikov
This is a brief note on the lower bound of bimachines. Particularly, we report that there is a class of functional transducers with states that do not admit a bimachine with…
Space-Efficient Bimachine Construction Based on the Equalizer Accumulation Principle
Stefan Gerdjikov, Stoyan Mihov, Klaus U. Schulz
Algorithms for building bimachines from functional transducers found in the literature in a run of the bimachine imitate one successful path of the input transducer. Each single bi…
Characterisation of (Sub)sequential Rational Functions over a General Class Monoids
Stefan Gerdjikov
In this technical report we describe a general class of monoids for which (sub)sequential rational can be characterised in terms of a congruence relation in the flavour of Myhill-N…
Myhill-Nerode Relation for Sequentiable Structures
Stefan Gerdjikov, Stoyan Mihov
Sequentiable structures are a subclass of monoids that generalise the free monoids and the monoid of non-negative real numbers with addition. In this paper we consider functions $f…
Corpus analysis without prior linguistic knowledge - unsupervised mining of phrases and subphrase structure
Stefan Gerdjikov, Klaus U. Schulz
When looking at the structure of natural language, "phrases" and "words" are central notions. We consider the problem of identifying such "meaningful subparts" of language of any l…
Good parts first - a new algorithm for approximate search in lexica and string databases
Stefan Gerdjikov, Stoyan Mihov, Petar Mitankin +1
We present a new efficient method for approximate search in electronic lexica. Given an input string (the pattern) and a similarity threshold, the algorithm retrieves all entries o…