Triple
T10018635
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Michael O. Rabin |
E199558
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Rabin–Scott powerset construction
The Rabin–Scott powerset construction is a fundamental algorithm in automata theory that converts nondeterministic finite automata (NFAs) into equivalent deterministic finite automata (DFAs) by using sets of states as single states.
|
E836300
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69ca8315a1a08190ab310f25620f362b |
elicitation | completed |
| NER | batch_69cdcd4de1588190a89ed575cff0b8c9 |
ner | completed |
| NED1 | batch_69d26aaa38188190aed8c18eccd8a79d |
ned_source_triple | completed |
| NED2 | batch_69d26f50dc008190866f0ba45b671560 |
ned_description | completed |
| NEDg | batch_69d26b84271881909c3a1b8a05e2c8a2 |
nedg | completed |
Created at: March 30, 2026, 8:53 p.m.