Let M be a class of (possibly nondeterministic) language acceptors with a one-way input tape. A system (A; A1,..., Ar) of automata in M is composable if for every string w = a1...an of symbols accepted by A, there is an assignment of each symbol aj in w to one of the Ai's such that for each 1 ≤ i ≤ r, the subsequence of w assigned to Ai is accepted by Ai. For a nonnegative integer k, a k-lookahead delegator for (A; A1,..., Ar) is a deterministic machine D in M which, knowing (a) the current states of A, A1,...,Ar and the accessible "local" information of each machine (e.g., the top of the stack if each machine is a pushdown automaton, whether a counter is zero or nonzero if each machine is a multicounter automaton, etc.), and (b) the k lookahead symbols to the right of the current input symbol being processed, can uniquely determine the Ai to assign the current symbol. Moreover, every string w accepted by A is also accepted by D; i.e., the subsequence of string w delegated by D to each Ai is accepted by Ai. Thus, k-lookahead delegation is a stronger requirement than composability, since the delegator D must be deterministic. A system that is composable may not have a k-delegator for any k.We study the decidability of composability and existence of k-delegators for various classes of machines M. Our results generalize earlier ones (and resolve some open questions) concerning composability of deterministic finite automata as e-services to finite automata that are augmented with unbounded storage (e.g., counters and pushdown stacks) and finite automata with discrete clocks (i.e., discrete timed automata). The results have applications to automated composition of e-services.
['Zhe Dang', 'Oscar H. Ibarra', 'Jianwen Su']
On composition and lookahead delegation of e -services modeled by automata