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 transitions). Unlike the standard NFA simulation, involving an algorithm which stores at each step all the states reached nondeterministically while reading the input, we consider deterministic finite automata (DFA) with lookahead, which choose the“right”NFA transitions based on a fixed number of input symbols read ahead. This concept, known as lookahead delegation, arose in a formal study of web services composition and its subsequent practical applications. Here we answer several related questions, such as “when is lookahead delegation possible?” and “how hard is it to find a delegator with a given lookahead buffer size?”. In particular, we show that only finite languages have the property that all of their NFA’s have delegators. This implies, among others, that delegation is a machine pr...

• Type: Conference
• Year: 2007
• Where: SOFSEM
• Authors: Bala Ravikumar, Nicolae Santean
• Keywords: Lookahead Delegation, SOFSEM 2007, Standard Nfa Simulation, Theoretical Computer Science, Unambiguous Nfa