Sciweavers

IJFCS
2007
105views more  IJFCS 2007»
14 years 11 days 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
14 years 6 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