Sciweavers

759 search results - page 86 / 152
» Odometers on Regular Languages
Sort
View
CICLING
2007
Springer
15 years 4 months ago
Finite-State Technology as a Programming Environment
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural lang...
Shuly Wintner
PPDP
2005
Springer
15 years 3 months ago
ReactiveML: a reactive extension to ML
We present ReactiveML, a programming language dedicated to the implementation of complex reactive systems as found in graphical user interfaces, video games or simulation problems...
Louis Mandel, Marc Pouzet
ICLP
2003
Springer
15 years 3 months ago
Termination Analysis with Types Is More Accurate
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
Vitaly Lagoon, Frédéric Mesnard, Pet...
IEEEMSP
2002
IEEE
15 years 2 months ago
Musical query-by-description as a multiclass learning problem
Abstract—We present the query-by-description (QBD) component of “Kandem,” a time-aware music retrieval system. The QBD system we describe learns a relation between descriptiv...
Brian Whitman, Ryan M. Rifkin
MFCS
1998
Springer
15 years 2 months ago
Deadlocking States in Context-Free Process Algebra
Recently the class of BPA (or context-free) processes has been intensively studied and bisimilarity and regularity appeared to be decidable (see [CHS95, BCS95, BCS96]). We extend t...
Jirí Srba