Sciweavers

3653 search results - page 182 / 731
» Learning of Partial Languages
Sort
View
104
Voted
LATIN
1992
Springer
15 years 7 months ago
On Reversible Automata
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivi...
Jean-Eric Pin
116
Voted
ESOP
1990
Springer
15 years 7 months ago
From Interpreting to Compiling Binding Times
The key to realistic self-applicable partial evaluation is to analyze binding times in the source program, i.e., whether the result of partially evaluating a source expression is ...
Charles Consel, Olivier Danvy
101
Voted
ICALP
2000
Springer
15 years 7 months ago
A Matrix-based Method for Analysing Stochastic Process Algebras
This paper demonstrates how three stochastic process algebras can be mapped on to a generally-distributed stochastic transition system. We demonstrate an aggregation technique on ...
Jeremy T. Bradley, N. J. Davies
127
Voted
EACL
1993
ACL Anthology
15 years 5 months ago
Parsing the Wall Street Journal with the Inside-Outside Algorithm
We report grammar inference experiments on partially parsed sentences taken from the Wall Street Journal corpus using the inside-outside algorithm for stochastic context-free gram...
Yves Schabes, Michal Roth, Randy Osborne
120
Voted
IFIP
2010
Springer
14 years 10 months ago
Modular Plans for Secure Service Composition
Service Oriented Computing (SOC) is a programming paradigm aiming at characterising Service Networks. Services are entities waiting for clients requests and they often result from ...
Gabriele Costa, Pierpaolo Degano, Fabio Martinelli