COLING
2000
13 years 5 months ago
2000
A deterministic finite state transducer is a fast device for analyzing strings. It takes O(n) time to analyze a string of length n. In this paper, an application of this technique...
ICWS
2004
IEEE
13 years 5 months ago
2004
IEEE
Web services advocate loosely coupled systems, although current loosely coupled applications are limited to stateless services. The reason for this limitation is the lack of a met...
IPPS
1996
IEEE
13 years 8 months ago
1996
IEEE
In this paper, we present a parallel algorithm for the minimization of deterministic finite state automata (DFA's) and discuss its implementation on a connection machine CM-5...
WWW
2005
ACM
14 years 5 months ago
2005
ACM
Web based applications offer a mainstream channel for businesses to manage their activities. We model such business activity in a grammar-based framework. The Backus Naur form not...