English

Detecting a single fault in a deterministic finite automaton

Formal Languages and Automata Theory 2021-06-02 v1 Discrete Mathematics

Abstract

Given a deterministic finite automaton and its implementation with at most one single fault, that we can test on a set of inputs, we provide an algorithm to find a test set that guarantees finding whether the fault exists.

Keywords

Cite

@article{arxiv.2106.00156,
  title  = {Detecting a single fault in a deterministic finite automaton},
  author = {Artur Polański and Eryk Lipka},
  journal= {arXiv preprint arXiv:2106.00156},
  year   = {2021}
}

Comments

13 pages

R2 v1 2026-06-24T02:41:12.578Z