Operations on Self-Verifying Finite Automata¶
Jirásek, J. S., & Jirásková, G. (2015). Operations on Self-Verifying Finite Automata. Computer Science — Theory and Applications, 231-261.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Self-Verifying Finite Automaton
- These two conditions, totality and noncontradiction, are properties of all complete runs on each word, not of a single favorable path.
This sourceFigure glyphs in the available text extraction are unreliable; no transition-level claim here rests on them. The 2011 original exact-bound article was available only as bibliographic record and abstract, so the theorem is attributed through this paper's explicit restatement.
- These two conditions, totality and noncontradiction, are properties of all complete runs on each word, not of a single favorable path.
Verification¶
Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:9eef0d8eec6d · see in the full table