595 search results - page 71 / 119 » Languages Of Analogical Strings |
CORR
1998
Springer
14 years 9 months ago
1998
Springer
This paper presents trainable methods for generating letter to sound rules from a given lexicon for use in pronouncing out-ofvocabulary words and as a method for lexicon compressi...
IJCM
2010
14 years 8 months ago
2010
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
POPL
2000
ACM
15 years 2 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
POPL
1997
ACM
15 years 1 months ago
1997
ACM
We investigateparametric polymorphism in message-basedconcurrentprogramming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambdacal...
122
click to vote
GLVLSI
1996
IEEE
15 years 1 months ago
1996
IEEE
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...