13 search results - page 3 / 3 » Unambiguous Automata |
IJFCS
2007
13 years 5 months ago
2007
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
The concept of determinism, while clear and well assessed for string languages, is still matter of research as far as picture languages are concerned. We introduce here a new kind ...
DLOG
2004
13 years 6 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...