Sciweavers

3 search results - page 1 / 1
» On the Existence of Lookahead Delegators for NFA
Sort
View
IJFCS
2007
105views more  IJFCS 2007»
13 years 4 months ago
On the Existence of Lookahead Delegators for NFA
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
Bala Ravikumar, Nicolae Santean
SOFSEM
2007
Springer
13 years 10 months ago
Deterministic Simulation of a NFA with k -Symbol Lookahead
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
Bala Ravikumar, Nicolae Santean
ICSOC
2004
Springer
13 years 10 months ago
Automated composition of e-services: lookaheads
The e-services paradigm promises to enable rich, flexible, and dynamic inter-operation of highly distributed, heterogeneous networkenabled services. Among the challenges, a funda...
Cagdas Evren Gerede, Richard Hull, Oscar H. Ibarra...