103 research outputs found
Enumeration and Decidable Properties of Automatic Sequences
We show that various aspects of k-automatic sequences -- such as having an
unbordered factor of length n -- are both decidable and effectively enumerable.
As a consequence it follows that many related sequences are either k-automatic
or k-regular. These include many sequences previously studied in the
literature, such as the recurrence function, the appearance function, and the
repetitivity index. We also give some new characterizations of the class of
k-regular sequences. Many results extend to other sequences defined in terms of
Pisot numeration systems
Speech Recognition by Composition of Weighted Finite Automata
We present a general framework based on weighted finite automata and weighted
finite-state transducers for describing and implementing speech recognizers.
The framework allows us to represent uniformly the information sources and data
structures used in recognition, including context-dependent units,
pronunciation dictionaries, language models and lattices. Furthermore, general
but efficient algorithms can used for combining information sources in actual
recognizers and for optimizing their application. In particular, a single
composition algorithm is used both to combine in advance information sources
such as language models and dictionaries, and to combine acoustic observations
and information sources dynamically during recognition.Comment: 24 pages, uses psfig.st
Algebras for weighted search
Weighted search is an essential component of many fundamental and useful algorithms. Despite this, it is relatively under explored as a computational effect, receiving not nearly as much attention as either depth- or breadth-first search. This paper explores the algebraic underpinning of weighted search, and demonstrates how to implement it as a monad transformer. The development first explores breadth-first search, which can be expressed as a polynomial over semirings. These polynomials are generalised to the free semi module monad to capture a wide range of applications, including probability monads, polynomial monads, and monads for weighted search. Finally, a monad trans-former based on the free semi module monad is introduced. Applying optimisations to this type yields an implementation of pairing heaps, which is then used to implement Dijkstra’s algorithm and efficient probabilistic sampling. The construction is formalised in Cubical Agda and implemented in Haskell
Weak bisimulations for labelled transition systems weighted over semirings
Weighted labelled transition systems are LTSs whose transitions are given
weights drawn from a commutative monoid. WLTSs subsume a wide range of LTSs,
providing a general notion of strong (weighted) bisimulation. In this paper we
extend this framework towards other behavioural equivalences, by considering
semirings of weights. Taking advantage of this extra structure, we introduce a
general notion of weak weighted bisimulation. We show that weak weighted
bisimulation coincides with the usual weak bisimulations in the cases of
non-deterministic and fully-probabilistic systems; moreover, it naturally
provides a definition of weak bisimulation also for kinds of LTSs where this
notion is currently missing (such as, stochastic systems). Finally, we provide
a categorical account of the coalgebraic construction of weak weighted
bisimulation; this construction points out how to port our approach to other
equivalences based on different notion of observability
- …