Triple
T6991396
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Thompson's algorithm for regular expression matching |
E162093
|
entity |
| Predicate | output |
P490
|
FINISHED |
| Object |
NFA
NFA (Nondeterministic Finite Automaton) is a theoretical model of computation used in automata theory and formal language processing to recognize regular languages, allowing multiple possible transitions for a given state and input symbol.
|
E632951
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69c68856d7808190ab33ee914640281b |
elicitation | completed |
| NER | batch_69c6dbc1f63c8190837cfd71cf5ed613 |
ner | completed |
| NED1 | batch_69c761d6ed5481909ccf1650fe6dc747 |
ned_source_triple | completed |
| NED2 | batch_69c763d604148190a3004ab99c79834f |
ned_description | completed |
| NEDg | batch_69c763053a308190a8bd34fe72be5065 |
nedg | completed |
Created at: March 27, 2026, 2:32 p.m.