Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
A new type of timed alternating finite automata (TAFA) called omega deterministic timed alternating finite automata (Ω-DTAFA) is described. DTAFA and Ω-DTAFA are synchronous and parallel computational models used for modeling real-time constraints computations and developing software systems. These models are extended with a finite set of mutually exclusive real-valued clocks on events which trigger the state transitions of the automaton. We consider some well-known automata-theoretic properties of TAFA, and investigate those properties in the case of Ω-DTAFA. We then show that, unlike timed finite automata (TFA) and TAFA, Ω-DTAFA are closed under all Boolean operations, including the complementation. Moreover, we show that the addition of alternation, timing, and determinism to finite automata increase their expressive and descriptional parallel power, as measured by the size of the automaton which has immediate practical applications in software and real-time systems.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it