d}for l∈ {5,10,15,20} , m∈ {1,3,5,10} , 16 Table 3: Average number of explanations computed if reaching the timeout

For the generated corpus, we generated m random words M with length l over the alphabet{1

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

cs.AI · 2026-02-12 · unverdicted · novelty 7.0

The work provides an efficient algorithm for computing minimal input character explanations for finite automata decisions.

Showing 1 of 1 citing paper.

A Formal Framework for the Explanation of Finite Automata Decisions cs.AI · 2026-02-12 · unverdicted · none · ref 37
The work provides an efficient algorithm for computing minimal input character explanations for finite automata decisions.