activity
20002020
most citedIncremental construction of minimal acyclic finite-state automata

51 citations · 58 across the 5 of their papers we have counts for

collaborators

5 papers

cs.FL2020★ 1 cited

Composition and Weight Pushing of Monotonic Subsequential Failure Transducers Representing Probabilistic Models

Diana Geneva, Georgi Shopov, Stoyan Mihov

We present a construction for the composition of subsequential transducers (representing conditional probabilistic models) with subsequential failure transducers (representing prob…

cs.FL2018

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…

cs.FL2017★ 1 cited

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…

cs.CL2013★ 5 cited

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…

cs.CL2000★ 51 cited

Incremental construction of minimal acyclic finite-state automata

Jan Daciuk, Stoyan Mihov, Bruce Watson +1

In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-state automata from a set of strings. Traditional methods consist of two phases: the…